Submodular function maximization via the multilinear relaxation and contention resolution schemes
C Chekuri, J Vondrák, R Zenklusen - … of the forty-third annual ACM …, 2011 - dl.acm.org
We consider the problem of maximizing a non-negative submodular set function f: 2N-> RR+
over a ground set N subject to a variety of packing type constraints including (multiple) …
over a ground set N subject to a variety of packing type constraints including (multiple) …
Online ad assignment with free disposal
We study an online weighted assignment problem with a set of fixed nodes corresponding to
advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a …
advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a …
A constant-factor approximation algorithm for unsplittable flow on paths
In the unsplittable flow problem on a path, we are given a capacitated path P and n tasks,
each task having a demand, a profit, and start and end vertices. The goal is to compute a …
each task having a demand, a profit, and start and end vertices. The goal is to compute a …
Dependent randomized rounding for matroid polytopes and applications
C Chekuri, J Vondrák, R Zenklusen - arXiv preprint arXiv:0909.4348, 2009 - arxiv.org
Motivated by several applications, we consider the problem of randomly rounding a
fractional solution in a matroid (base) polytope to an integral one. We consider the pipage …
fractional solution in a matroid (base) polytope to an integral one. We consider the pipage …
A mazing 2+ ε approximation for unsplittable flow on a path
We study the problem of unsplittable flow on a path (UFP), which arises naturally in many
applications such as bandwidth allocation, job scheduling, and caching. Here we are given …
applications such as bandwidth allocation, job scheduling, and caching. Here we are given …
New approximation schemes for unsplittable flow on a path
We study the unsplittable flow on a path problem which has received a lot of attention in the
research community recently. Given is a path with capacities on its edges and a set of tasks …
research community recently. Given is a path with capacities on its edges and a set of tasks …
A (5/3+ ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
In the unsplittable flow on a path problem (UFP) we are given a path with edge capacities
and a collection of tasks. Each task is characterized by a subpath, a profit, and a demand …
and a collection of tasks. Each task is characterized by a subpath, a profit, and a demand …
A PTAS for unsplittable flow on a path
In the Unsplittable Flow on a Path problem (UFP) we are given a path with edge capacities,
and a set of tasks where each task is characterized by a subpath, a demand, and a weight …
and a set of tasks where each task is characterized by a subpath, a demand, and a weight …
On column-restricted and priority covering integer programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any
column of the constraint matrix are equal. Such programs capture capacitated versions of …
column of the constraint matrix are equal. Such programs capture capacitated versions of …
Unsplittable flow on a path: The game!
The unsplittable flow on a path (UFP) problem is a well-studied optimization problem, and it
has applications in various settings like bandwidth allocation, caching, and scheduling. We …
has applications in various settings like bandwidth allocation, caching, and scheduling. We …