On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
From MaRDI portal
Publication:1975964
Recommendations
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- On the approximability of some network design problems
- On the approximability of some network design problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Cites work
- scientific article; zbMATH DE number 1187149 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1261807 (Why is no real title available?)
- scientific article; zbMATH DE number 1263178 (Why is no real title available?)
- Improved Approximation Algorithms for Shop Scheduling Problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On the Computational Complexity of Combinatorial Problems
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
Cited in
(8)- Packing trees in communication networks
- Fixed topology Steiner trees and spanning forests
- Minimum k arborescences with bandwidth constraints
- On the edge capacitated Steiner tree problem
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- On the disjoint paths problem
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On routing in VLSI design and communication networks
This page was built for publication: On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975964)
