The following pages link to Julia Chuzhoy (Q653830):
Displayed 50 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- (Q2913818) (← links)
- (Q2921762) (← links)
- (Q2921763) (← links)
- Hardness of cut problems in directed graphs (Q2931415) (← links)
- Excluded Grid Theorem (Q2941560) (← links)
- Algorithmic aspects of bandwidth trading (Q2944546) (← links)
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply (Q3167386) (← links)
- Polynomial Bounds for the Grid-Minor Theorem (Q3177816) (← links)
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 (Q3177821) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- Covering Problems with Hard Capacities (Q3434996) (← links)
- Polynomial flow-cut gaps and hardness of directed cut problems (Q3452200) (← links)
- Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291) (← links)
- (Q3549611) (← links)
- (Q3549612) (← links)
- (Q3549697) (← links)
- Asymmetric k-center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3580956) (← links)
- Low-distortion embeddings of general metrics into the line (Q3581393) (← links)
- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems (Q3588397) (← links)
- (Q3601539) (← links)
- Resource Minimization Job Scheduling (Q3638870) (← links)
- (Q4449217) (← links)
- (Q4589020) (← links)
- (Q4633902) (← links)
- Approximation Algorithms and Hardness of the <i>k</i> -Route Cut Problem (Q4962202) (← links)
- On the approximability of some network design problems (Q4962716) (← links)
- New hardness results for routing on disjoint paths (Q4977963) (← links)
- (Q5002709) (← links)
- (Q5158500) (← links)
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design (Q5171193) (← links)
- On Allocating Goods to Maximize Fairness (Q5171208) (← links)
- A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems (Q5212780) (← links)
- Almost polynomial hardness of node-disjoint paths in grids (Q5230375) (← links)
- Towards Tight(er) Bounds for the Excluded Grid Theorem (Q5236272) (← links)
- Polynomial bounds for the grid-minor theorem (Q5259539) (← links)
- On Approximating Node-Disjoint Paths in Grids (Q5351898) (← links)
- Improved approximation for node-disjoint paths in planar graphs (Q5361861) (← links)
- Degree-3 Treewidth Sparsifiers (Q5363031) (← links)
- Improved Bounds for the Flat Wall Theorem (Q5363032) (← links)
- (Q5365099) (← links)
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems (Q5388006) (← links)
- On vertex sparsifiers with Steiner nodes (Q5415509) (← links)
- Approximation algorithms and hardness of integral concurrent flow (Q5415510) (← links)
- Routing in undirected graphs with constant congestion (Q5415520) (← links)
- (Q5417712) (← links)
- An algorithm for the graph crossing number problem (Q5419100) (← links)