|
Search the dblp DataBase
Julia Chuzhoy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
Embedding ultrametrics into low-dimensional spaces. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:187-196 [Conf]
- Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. [Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:226-244 [Conf]
- Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
Machine Minimization for Scheduling Jobs with Interval Constraints. [Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:81-90 [Conf]
- Julia Chuzhoy, Joseph Naor
Covering Problems with Hard Capacities. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:481-489 [Conf]
- Julia Chuzhoy, Joseph Naor
The Hardness of Metric Labeling. [Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:108-114 [Conf]
- Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:348-356 [Conf]
- Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
Algorithmic Aspects of Bandwidth Trading. [Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:751-766 [Conf]
- Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Non-cooperative multicast and facility location games. [Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2006, pp:72-81 [Conf]
- Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
On the approximability of some network design problems. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:943-951 [Conf]
- Julia Chuzhoy, Yuval Rabani
Approximating k-median with non-uniform capacities. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:952-958 [Conf]
- Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
Low-distortion embeddings of general metrics into the line. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:225-233 [Conf]
- Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor
Asymmetric k-center is log* n-hard to approximate. [Citation Graph (0, 0)][DBLP] STOC, 2004, pp:21-27 [Conf]
- Julia Chuzhoy, Sanjeev Khanna
Hardness of cut problems in directed graphs. [Citation Graph (0, 0)][DBLP] STOC, 2006, pp:527-536 [Conf]
- Julia Chuzhoy, Joseph Naor
New hardness results for congestion minimization and machine scheduling. [Citation Graph (0, 0)][DBLP] STOC, 2004, pp:28-34 [Conf]
- Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
Asymmetric k-center is log*n-hard to Approximate [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:038, pp:- [Journal]
- Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor
Asymmetric k-center is log* n-hard to approximate. [Citation Graph (0, 0)][DBLP] J. ACM, 2005, v:52, n:4, pp:538-551 [Journal]
- Julia Chuzhoy, Joseph Naor
New hardness results for congestion minimization and machine scheduling. [Citation Graph (0, 0)][DBLP] J. ACM, 2006, v:53, n:5, pp:707-721 [Journal]
- Julia Chuzhoy, Joseph Naor
Covering Problems with Hard Capacities. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:2, pp:498-515 [Journal]
- Julia Chuzhoy, Joseph Naor
The Hardness of Metric Labeling. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:5, pp:1376-1386 [Journal]
- Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
Algorithmic aspects of bandwidth trading. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
- Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
Hardness of routing with congestion in directed graphs. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:165-178 [Conf]
- Julia Chuzhoy, Sanjeev Khanna
Polynomial flow-cut gaps and hardness of directed cut problems. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:179-188 [Conf]
Resource Minimization Job Scheduling. [Citation Graph (, )][DBLP]
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. [Citation Graph (, )][DBLP]
Algorithms for Single-Source Vertex Connectivity. [Citation Graph (, )][DBLP]
On Allocating Goods to Maximize Fairness. [Citation Graph (, )][DBLP]
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. [Citation Graph (, )][DBLP]
Maximum independent set of rectangles. [Citation Graph (, )][DBLP]
Resource Minimization for Fire Containment. [Citation Graph (, )][DBLP]
Network design for vertex connectivity. [Citation Graph (, )][DBLP]
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design [Citation Graph (, )][DBLP]
On Allocating Goods to Maximize Fairness [Citation Graph (, )][DBLP]
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. [Citation Graph (, )][DBLP]
Hardness of Directed Routing with Congestion. [Citation Graph (, )][DBLP]
Search in 0.011secs, Finished in 0.012secs
|