Publications related to A note on the integrality gap of the configuration LP for restricted Santa Claus

Applications of Strong Convex Relaxations to Allocation Problems

Approximation algorithms are a commonly used tool for designing efficient algorithmic solutions for intractable problems, at the expense of the quality of the output solution. A prominent technique for designing such algorithms is the use of Linear Program ...

EPFL2017

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Group-Sparse Model Selection: Hardness and Relaxations

Volkan Cevher, Anastasios Kyrillidis, Luca Baldassarre, Nirav Bhan

Group-based sparsity models are proven instrumental in linear regression problems for recovering signals from much fewer measurements than standard compressive sensing. The main promise of these models is the recovery of ``interpretable" signals along with ...

Institute of Electrical and Electronics Engineers2016

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

Optimizing transshipment workloads in less-than-truckload cross-docks

Mohammad Yousef Maknoon

This paper presents a scheduling model to enhance cross-docking operations. It attempts to reduce the transshipment workload by minimizing the total number of products that require double-handling. We formalize the problem and represent its mathematical fo ...

Elsevier Science Bv2016

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Pascal Frossard

In free viewpoint video, a viewer can choose at will any camera angle or the so-called "virtual view" to observe a dynamic 3-D scene, enhancing his/her depth perception. The virtual view is synthesized using texture and depth videos of two anchor camera vi ...

2015

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Chidambaram Annamalai

We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a ce ...

2014

Tractability of interpretability via selection of group-sparse models

Volkan Cevher, Luca Baldassarre, Nirav Bhan

Group-based sparsity models are proven instrumental in linear regression problems for recovering signals from much fewer measurements than standard compressive sensing. A promise of these models is to lead to “interpretable” signals for which we identify i ...

2013

Multi-Agent Learning for Resource Allocation Problems

Ludek Cigler

We analyze resource allocation problems where N independent agents want to access C resources. Each resource can be only accessed by one agent at a time. In order to use the resources efficiently, the agents need to coordinate their access. We focus on dec ...

EPFL2013

A note on the integrality gap of the configuration LP for restricted Santa Claus

Graph Chatbot

Chat with Graph Search

Applications of Strong Convex Relaxations to Allocation Problems

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Group-Sparse Model Selection: Hardness and Relaxations

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

Optimizing transshipment workloads in less-than-truckload cross-docks

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Node-weighted network design and maximum sub-determinants

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Tractability of interpretability via selection of group-sparse models

Multi-Agent Learning for Resource Allocation Problems

Applications of Strong Convex Relaxations to Allocation Problems

Group-Sparse Model Selection: Hardness and Relaxations

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Optimizing transshipment workloads in less-than-truckload cross-docks

Multi-Agent Learning for Resource Allocation Problems

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

Tractability of interpretability via selection of group-sparse models

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Node-weighted network design and maximum sub-determinants