Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The parameterized complexity of the survivable network design problem

From MaRDI portal
Publication:6538769
Jump to:navigation, search

DOI10.1137/1.9781611977066.4MaRDI QIDQ6538769

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

Publication date: 14 May 2024





Mathematics Subject Classification ID

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



Related Items (2)

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






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6538769&oldid=40062196"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki