Pages that link to "Item:Q653831"

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

Displayed 11 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)
• New tools and connections for exponential-time approximation (Q2272598) ‎ (← links)
• Routing with congestion in acyclic digraphs (Q2274522) ‎ (← links)
• Routing in Undirected Graphs with Constant Congestion (Q2817791) ‎ (← links)
• Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs (Q2988851) ‎ (← links)
• Maximum Throughput Network Routing Subject to Fair Flow Allocation (Q3195309) ‎ (← links)
• New Hardness Results for Routing on Disjoint Paths (Q3387753) ‎ (← links)
• Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) ‎ (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) ‎ (← links)
• Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966289) ‎ (← links)