Publications related to Results on Sparse Integer Programming and Geometric Independent Sets

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.

Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation

Ola Nils Anders Svensson, Lukas Polacek

The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. [2012] ...

Assoc Computing Machinery2016

An Efficient Streaming Algorithm for the Submodular Cover Problem

Volkan Cevher, Ilija Bogunovic, Ya-Ping Hsieh, Ashkan Norouzi Fard, Abbas Bazzi, Marwa El Halabi

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream wi ...

2016

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Bernard Moret, Mingfu Shao

A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when ge ...

Mary Ann Liebert, Inc2016

Submodular Stochastic Probing on Matroids

Justin Dean Ward, Marek Adamczyk

In a stochastic probing problem we are given a universe E, and a probability that each element e in E is active. We determine if an element is active by probing it, and whenever a probed element is active, we must permanently include it in our solution. Mo ...

INFORMS2016

Removing and Adding Edges for the Traveling Salesman Problem

Ola Nils Anders Svensson

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a d ...

Assoc Computing Machinery2016

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e

Ola Nils Anders Svensson, Abbas Bazzi

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regevproved that the problem is NP-hard to approximate within a factor2 - ∈, assuming the Unique Games Conjecture (UGC). This is tig ...

IEEE Computer Society2015

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Results on Sparse Integer Programming and Geometric Independent Sets

Graph Chatbot

Chat with Graph Search

Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation

Pattern formation with voluminous processes

An Efficient Streaming Algorithm for the Submodular Cover Problem

Collision-Free Pattern Formation

A New Framework for Distributed Submodular Maximization

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Submodular Stochastic Probing on Matroids

Removing and Adding Edges for the Traveling Salesman Problem

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e

Centrality of trees for capacitated -center

An Efficient Streaming Algorithm for the Submodular Cover Problem

Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation

Pattern formation with voluminous processes

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Removing and Adding Edges for the Traveling Salesman Problem

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e

Collision-Free Pattern Formation

A New Framework for Distributed Submodular Maximization

Submodular Stochastic Probing on Matroids

Centrality of trees for capacitated -center