Pages that link to "Item:Q3177821"
From MaRDI portal
The following pages link to A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 (Q3177821):
Displaying 14 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope (Q2480058) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- Planar Digraphs (Q3120437) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- The fractional congestion bound for efficient edge disjoint routing (Q3507649) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← 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)
- (Q5090497) (← links)
- (Q5158500) (← links)
- Congestion minimization for multipath routing via multiroute flows (Q5240417) (← links)