Pages that link to "Item:Q653831"
From MaRDI portal
The following pages link to Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831):
Displaying 15 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)
- 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)
- 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)
- (Q5002709) (← links)
- (Q5075819) (← links)
- (Q5158500) (← links)
- Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966289) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
