• Publications
  • Influence
Covering problems with hard capacities
  • Julia Chuzhoy, J. Naor
  • Mathematics, Computer Science
  • The 43rd Annual IEEE Symposium on Foundations of…
  • 16 November 2002
TLDR
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. Expand
  • 99
  • 20
  • PDF
Polynomial bounds for the grid-minor theorem
TLDR
We obtain the first polynomial relationship between treewidth and grid-minor size by showing that f(k) = Ω(kδ) for some fixed constant δ > 0, and describe an algorithm that finds a model of such a grid minor in G. Expand
  • 126
  • 20
  • PDF
Approximation algorithms for the job interval selection problem and related scheduling problems
TLDR
The authors consider the job interval selection problem (JISP), a simple scheduling model with a rich history and numerous applications, and show an approximation guarantee of less than 1.582 for arbitrary instances of JISP. Expand
  • 93
  • 11
  • PDF
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
  • Julia Chuzhoy, S. Khanna
  • Mathematics, Computer Science
  • 50th Annual IEEE Symposium on Foundations of…
  • 23 December 2008
TLDR
In the Survivable Network Design problem (SNDP), we are given an undirected graph $G(V, E)$ with costs on edges, along with a connectivity requirement $r(u, v)$ for each pair of vertices. Expand
  • 70
  • 10
  • PDF
Asymmetric k-center is log* n-hard to approximate
TLDR
We show that the ASYMMETRIC <i>k</i>-CENTER problem is hard to approximate up to a factor of log<sup>*</sup><i>n</ i>−<i>O</i>(1) unless an asymptotic approximability algorithm is known for this problem. Expand
  • 71
  • 8
  • PDF
Network design for vertex connectivity
TLDR
We study the survivable network design problem (SNDP) for vertex connectivity. Expand
  • 57
  • 7
  • PDF
On the approximability of some network design problems
TLDR
This is one of many network design problems widely studied where the bandwidth allocation being governed by side constraints: edges may only allow a subset of cables to be purchased on them, or certain quality-of-service requirements may have to be met. Expand
  • 62
  • 6
  • PDF
The hardness of metric labeling
  • Julia Chuzhoy, J. Naor
  • Mathematics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of…
  • 17 October 2004
TLDR
The metric labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. Expand
  • 28
  • 6
  • PDF
Maximum independent set of rectangles
TLDR
We study the Maximum Independent Set of Rectangles (MISR) problem: given a collection R of n axis-parallel rectangles, find a maximum-cardinality subset of disjoint rectangles. Expand
  • 96
  • 5
  • PDF