Pages that link to "Item:Q2933646"
From MaRDI portal
The following pages link to An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs (Q2933646):
Displaying 6 items.
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Improved approximation for node-disjoint paths in grids with sources on the boundary (Q5002709) (← links)
- (Q5158500) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)