Julia Chuzhoy

Publications
Influence

Julia Chuzhoy, J. Naor
Mathematics, Computer Science
The 43rd Annual IEEE Symposium on Foundations of…
16 November 2002

We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. Expand

Polynomial bounds for the grid-minor theorem

C. Chekuri, Julia Chuzhoy
Computer Science, Mathematics
J. ACM
28 May 2013

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

Approximation algorithms for the job interval selection problem and related scheduling problems

Julia Chuzhoy, R. Ostrovsky, Y. Rabani
Computer Science
Proceedings IEEE International Conference on…
14 October 2001

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

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

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

Asymmetric k-center is log* n-hard to approximate

Julia Chuzhoy, S. Guha, S. Khanna, J. Naor
Mathematics, Computer Science
JACM
1 July 2005

We show that the ASYMMETRIC k-CENTER problem is hard to approximate up to a factor of log*n−O(1) unless an asymptotic approximability algorithm is known for this problem. Expand

Network design for vertex connectivity

Tanmoy Chakraborty, Julia Chuzhoy, S. Khanna
Mathematics, Computer Science
STOC '08
17 May 2008

We study the survivable network design problem (SNDP) for vertex connectivity. Expand

On the approximability of some network design problems

Julia Chuzhoy, A. Gupta, J. Naor, A. Sinha
Mathematics, Computer Science
SODA '05
23 January 2005

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

The hardness of metric labeling

Julia Chuzhoy, J. Naor
Mathematics, Computer Science
45th Annual IEEE Symposium on Foundations of…
17 October 2004

The metric labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. Expand

An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

Julia Chuzhoy, S. Khanna
Computer Science
Theory Comput.
17 August 2012

Maximum independent set of rectangles

Parinya Chalermsook, Julia Chuzhoy
Mathematics, Computer Science
SODA
4 January 2009

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

Recommended Authors