Pages that link to "Item:Q2757635"
From MaRDI portal
The following pages link to Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems (Q2757635):
Displayed 14 items.
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A note on the greedy algorithm for the unsplittable flow problem (Q1028992) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- Approximating low-congestion routing and column-restricted packing problems (Q1607041) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)
- Flows with Unit Path Capacities and Related Packing and Covering Problems (Q5505656) (← links)
- Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)