Publications related to The interval constrained 3-coloring problem

Succinct ordering and aggregation constraints in algebraic array theories

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Serge Vaudenay, Bénédikt Minh Dang Tran

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

Springer2023

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2022

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Oliver Kröcher, Frédéric Vogel, David Baudouin, Ayush Agarwal

Ru/CNF catalysts of different Ru nanoparticle (NP) sizes (0.9-2.7 nm) were assessed for their performance in continuous supercritical water gasification (SCWG) of glycerol. A structure sensitivity of Ru was demonstrated, with high initial turnover frequenc ...

2022

Automating cutting planes is NP-hard

Mika Tapani Göös

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...

ACM2021

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. The input consists of a set of jobs, characterized by their processing times, release time ...

ASSOC COMPUTING MACHINERY2021

Bayesian Decision Making in Groups is Hard

Jan Hazla

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

INFORMS2021

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

The interval constrained 3-coloring problem

Graph Chatbot

Chat with Graph Search

Succinct ordering and aggregation constraints in algebraic array theories

Approximation Algorithms for Allocation and Network Design

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Discrete Optimal Transport with Independent Marginals is #P-Hard

The double exponential runtime is tight for 2-stage stochastic ILPs

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Automating cutting planes is NP-hard

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Bayesian Decision Making in Groups is Hard

New Results in Integer and Lattice Programming

Discrete Optimal Transport with Independent Marginals is #P-Hard

Succinct ordering and aggregation constraints in algebraic array theories

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Automating cutting planes is NP-hard

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

The double exponential runtime is tight for 2-stage stochastic ILPs

Approximation Algorithms for Allocation and Network Design

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Bayesian Decision Making in Groups is Hard

New Results in Integer and Lattice Programming