The complexity landscape of disaster‐aware network extension problems

DOI10.1002/NET.22199OpenAlexW4389683222MaRDI QIDQ6196887FDOQ6196887

Authors: János Tapolcai 

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

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

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

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)

Cites Work

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

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)