Pages that link to "Item:Q1273862"
From MaRDI portal
The following pages link to Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862):
Displaying 13 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Approximation algorithms for time-constrained scheduling on line networks (Q693767) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- New Hardness Results for Routing on Disjoint Paths (Q3387753) (← links)
- (Q5002709) (← links)
- (Q5158500) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← 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)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
