Pages that link to "Item:Q4986808"
From MaRDI portal
The following pages link to An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808):
Displaying 11 items.
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- A note on packing paths in planar graphs (Q1906072) (← links)
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 (Q3177821) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- (Q4442188) (← links)
- An exponential time parameterized algorithm for planar disjoint paths (Q5145014) (← links)
- Improved approximation for node-disjoint paths in planar graphs (Q5361861) (← links)
- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow (Q5450805) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)