Testing additive integrality gaps

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

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 ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

Group testing is a technique that can reduce the number of tests needed to identify infected members in a population, by pooling together multiple diagnostic samples. Despite the variety and importance of prior results, traditional work on group testing ha ...

Masonry buildings form building aggregates around the world in historical centers, which developed as the layout of the city or village densified. In these aggregates, adjacent buildings can share structural walls, connected at the interfaces by interlocki ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

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 ...

The plastic deformation of small-scale face-centered cubic metals exhibits intermittent slip burst events that appear on stress-strain curves as sudden strain jumps and/or load drops. These events are generally attributed to the avalanche-like cooperative ...

Hydropower plants play a crucial role in the power system facing ambitious renewable energy targets. Due to their inherent controllability, they are well suited to provide flexibility to the grid. However, an increased flexibility provision leads to a prol ...

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

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 ...

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 = ...

The substitution of portland clinker by supplementary cementitious materials (SCMs) is one of the main avenues for the further decarbonization of cement production. To secure future SCM supplies, generic and performance-related test methods for SCMs are re ...

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

How can we discern whether the covariance operator of a stochastic pro-cess is of reduced rank, and if so, what its precise rank is? And how can we do so at a given level of confidence? This question is central to a great deal of methods for functional dat ...

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. ...

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

Testing additive integrality gaps

Chat with Graph Search

Succinct ordering and aggregation constraints in algebraic array theories

Approximation Algorithms for Allocation and Network Design

Results on Sparse Integer Programming and Geometric Independent Sets

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Community-Aware Group Testing

Seismic Testing of Adjacent Interacting Masonry Structures

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

On the slip burst amplitude cutoff in dislocation-rich microcrystals

Structural impact of the start-up sequence on Pelton turbines lifetime: Analytical prediction and polynomial optimization

Better Trees for Santa Claus

Discrete Optimal Transport with Independent Marginals is #P-Hard

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

Interlaboratory Test Program to Determine the Precision of the R3 Test Method (ASTM C1897-20) for Measuring Reactivity of Supplementary Cementitious Materials

Streaming and Matching Problems with Submodular Functions

Testing For The Rank Of A Covariance Operator

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Minimum Cost Intervention Design for Causal Effect Identification

Motif Cut Sparsifiers

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes