The parameterized complexity of the survivable network design problem

DOI10.1137/1.9781611977066.4MaRDI QIDQ6538769zbMATH OpenFDO

Authors Andreas Emil Feldmann, A. Mukherjee, Erik Jan van Leeuwen

Publication date 14 May 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• The parameterized complexity of the survivable network design problem
• Parameterized algorithms for survivable network design with uniform demands
• scientific article; zbMATH DE number 1947057
• Parameterized complexity of arc-weighted directed Steiner problems
• Hardness of Approximation for Vertex-Connectivity Network Design Problems

Cited in

(2)

• The parameterized complexity of the survivable network design problem
• Improved approximations for relative survivable network design

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)