The parameterized complexity of the survivable network design problem
From MaRDI portal
Recommendations
- The parameterized complexity of the survivable network design problem
- Parameterized algorithms for survivable network design with uniform demands
- Hardness of approximation for vertex-connectivity network-design problems
- Parameterized complexity of arc-weighted directed Steiner problems
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
Cited in
(4)
This page was built for publication: The parameterized complexity of the survivable network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538769)