Publications related to Approximating Linear Threshold Predicates

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

Strengths and Limitations of Linear Programming Relaxations

Abbas Bazzi

Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power, this class of algorithms seems to contain the most favourable ...

EPFL2017

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

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

Distributed wireless video caching placement for dynamic adaptive streaming

Pascal Frossard, Chenglin Li

Caching at edge servers can smooth the temporal traffic variability and reduce the service load of base stations in wireless streaming. However, the assignment of the cached content for possibly multiple versions of different video sequences is still a cha ...

2016

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

Pascal Frossard, Laura Toni, Chenglin Li

In this paper, we propose a representation selection optimization problem for complexity constrained adaptive video streaming that properly takes into account the different complexity-rate-distortion (C-R-D) characteristics of the videos when implementing ...

Ieee2016

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

On the configuration LP for maximum budgeted allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Lukas Polacek, Aleksander Madry

We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer Heidelberg2015

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014

On the Configuration LP for Maximum Budgeted Allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Lukas Polacek, Aleksander Madry

We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer2014

Approximating Linear Threshold Predicates

Graph Chatbot

Chat with Graph Search

Applications of Strong Convex Relaxations to Allocation Problems

Strengths and Limitations of Linear Programming Relaxations

Dynamic Facility Location via Exponential Clocks

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

Distributed wireless video caching placement for dynamic adaptive streaming

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

On the configuration LP for maximum budgeted allocation

Opaque Sets

On the Configuration LP for Maximum Budgeted Allocation

Applications of Strong Convex Relaxations to Allocation Problems

Dynamic Facility Location via Exponential Clocks

Strengths and Limitations of Linear Programming Relaxations

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Opaque Sets

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

Distributed wireless video caching placement for dynamic adaptive streaming

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

On the configuration LP for maximum budgeted allocation

On the Configuration LP for Maximum Budgeted Allocation