Searching for authors named "Julia Chuzhoy" – sorted by Relevance.
-
Approximating k-median with non-uniform capacities
- Approximating k-Median with Non-Uniform Capacities Julia Chuzhoy ∗ Yuval Rabani † Abstract
- Cited by 5 (0 self) – Add To MetaCart
-
Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems
- Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems ∗ Julia Chuzhoy † Sanjeev Khanna
- Cited by 1 (0 self) – Add To MetaCart
-
New hardness results for undirected edge disjoint paths
- New Hardness Results for Undirected Edge Disjoint Paths Julia Chuzhoy* Sanjeev Khanna# July
- Cited by 1 (0 self) – Add To MetaCart
-
Hardness of Routing with Congestion in Directed Graphs
- Hardness of Routing with Congestion in Directed Graphs ABSTRACT Julia Chuzhoy ∗ School
- Cited by 2 (1 self) – Add To MetaCart
-
Algorithms for Single-Source Vertex Connectivity
- Algorithms for Single-Source Vertex Connectivity Julia Chuzhoy Toyota Technological Institute
- Cited by 5 (2 self) – Add To MetaCart
-
An O(k 3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- An O(k 3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design Julia
- Cited by 1 (0 self) – Add To MetaCart
-
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- \Lambda Julia Chuzhoy y Computer Science Department Technion -- IIT Haifa 32000, Israel E
- Cited by 12 (1 self) – Add To MetaCart
-
On Allocating Goods to Maximize Fairness
- On Allocating Goods to Maximize Fairness Deeparnab Chakrabarty ∗ Julia Chuzhoy † Sanjeev Khanna
- Add To MetaCart
-
Hardness of the undirected edge-disjoint paths problem with congestion
- Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion Matthew Andrews* Julia
- Cited by 26 (4 self) – Add To MetaCart
-
Network Design for Vertex Connectivity
- of Pennsylvania Philadelphia PA tanmoy@(email omitted); Julia Chuzhoy Toyota Technological Institute Chicago, IL
- Cited by 3 (2 self) – Add To MetaCart

