Pages that link to "Item:Q653831"

The following pages link to Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831):

Displaying 24 items.

• Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
• Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs (Q1613354) (← links)
• On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964) (← links)
• Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
• Electrical flows over spanning trees (Q2097649) (← links)
• New tools and connections for exponential-time approximation (Q2272598) (← links)
• Routing with congestion in acyclic digraphs (Q2274522) (← links)
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
• Routing in undirected graphs with constant congestion (Q2817791) (← links)
• Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs (Q2988851) (← links)
• (Q3002769) (← links)
• A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 (Q3177821) (← links)
• Maximum Throughput Network Routing Subject to Fair Flow Allocation (Q3195309) (← links)
• New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
• The fractional congestion bound for efficient edge disjoint routing (Q3507649) (← links)
• Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
• An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (Q4962640) (← links)
• Improved approximation for node-disjoint paths in grids with sources on the boundary (Q5002709) (← links)
• (Q5075819) (← links)
• (Q5158500) (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
• Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966289) (← links)
• Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)