Pages that link to "Item:Q3581429"
From MaRDI portal
The following pages link to Hardness of the undirected congestion minimization problem (Q3581429):
Displayed 7 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- On the approximation of the single source \(k\)-splittable flow problem (Q935843) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs (Q2988851) (← links)
- Flows on few paths: Algorithms and lower bounds (Q5487813) (← links)