|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 47 occurrences of 24 keywords
|
|
|
|
|
Results
Found 51 publication records. Showing 51 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Julia Chuzhoy |
On Vertex Sparsifiers with Steiner Nodes  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou |
Approximation algorithms and hardness of the k-route cut problem. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy |
Routing in undirected graphs with constant congestion. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li |
Approximation algorithms and hardness of integral concurrent flow. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy |
On vertex sparsifiers with Steiner nodes. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy |
Routing in Undirected Graphs with Constant Congestion |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou |
Approximation Algorithms and Hardness of the k-Route Cut Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos |
On Graph Crossing Number and Edge Planarization. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy |
An algorithm for the graph crossing number problem. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang |
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos |
On Graph Crossing Number and Edge Planarization |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy |
An Algorithm for the Graph Crossing Number Problem |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parinya Chalermsook, Julia Chuzhoy |
Resource Minimization for Fire Containment. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Julia Chuzhoy |
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
Directed multicut, hardness of approximation, sparsest cut |
| 1 | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
On Allocating Goods to Maximize Fairness |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Parinya Chalermsook, Julia Chuzhoy |
Maximum independent set of rectangles. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Paolo Codenotti |
Resource Minimization Job Scheduling. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
On Allocating Goods to Maximize Fairness. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Approximation Algorithms, Allocation Problems |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
vertex-connectivity, survivable network design |
| 1 | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy |
Generalized Steiner Network. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Algorithms for Single-Source Vertex Connectivity. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna |
Network design for vertex connectivity. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, hardness of approximation, vertex connectivity |
| 1 | Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang |
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor |
Algorithmic aspects of bandwidth trading. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms for NP-hard problems, scheduling, resource allocation, dynamic storage allocation, general caching |
| 1 | Julia Chuzhoy, Joseph Naor |
The Hardness of Metric Labeling. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
Non-Cooperative Multicast and Facility Location Games. |
IEEE Journal on Selected Areas in Communications |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
| 1 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of Directed Routing with Congestion. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Julia Chuzhoy, Joseph Naor |
New hardness results for congestion minimization and machine scheduling. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
resource minimization, scheduling, network routing, Hardness of approximation, congestion minimization |
| 1 | Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani |
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. |
Math. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Joseph Naor |
Covering Problems with Hard Capacities. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos |
Embedding ultrametrics into low-dimensional spaces. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, embedding, ultrametrics |
| 1 | Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
Non-cooperative multicast and facility location games. |
ACM Conference on Electronic Commerce |
2006 |
DBLP DOI BibTeX RDF |
multicast game, nash equilibrium, price of anarchy, price of stability |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of cut problems in directed graphs. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
directed multicut, hardness of approximation, sparsest cut |
| 1 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation |
| 1 | Julia Chuzhoy, Yuval Rabani |
Approximating k-median with non-uniform capacities. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang |
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos |
Low-distortion embeddings of general metrics into the line. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
approxiation algorithms, metric embeddings |
| 1 | Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor |
Machine Minimization for Scheduling Jobs with Interval Constraints. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Joseph Naor |
The Hardness of Metric Labeling. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, approximation algorithms, hardness of approximation |
| 1 | Julia Chuzhoy, Joseph Naor |
New hardness results for congestion minimization and machine scheduling. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
routing, approximation algorithms, hardness of approximation, machine scheduling, congestion minimization |
| 1 | Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor |
Asymmetric k-center is log*n-hard to Approximate |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor |
Algorithmic Aspects of Bandwidth Trading. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
bandwidth trading, primal-dual schema, Scheduling, approximation algorithms |
| 1 | Julia Chuzhoy, Joseph Naor |
Covering Problems with Hard Capacities. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani |
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #51 of 51 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")