The complexity landscape of disaster‐aware network extension problems

DOI10.1002/NET.22199MaRDI QIDQ6196887zbMATH OpenOpenAlexFDO

Authors János Tapolcai

Publication date 15 March 2024

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/net.22199

zbMATH Keywords

complexity theorygeometric graphsnetwork robustnessnetwork augmentationlarge scale disastersregional failure

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Resilience of communication networks to random failures and disasters: An optimization perspective
• Publication:3484607
• The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
• Approaches to the Steiner Problem in Networks
• A model for optimal reinforcement of error- and attack-resilient clusters in networks under uncertainty

Cites work

• Hamilton Paths in Grid Graphs
• Minimum weight connectivity augmentation for planar straight-line graphs
• On the structure and complexity of the 2-connected Steiner network problem in the plane

This page was built for publication: The complexity landscape of disaster‐aware network extension problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196887)