Robust subgraphs for trees and paths

DOI10.1145/1150334.1150341MaRDI QIDQ2944516zbMATH OpenOpenAlexFDO

Authors Refael Hassin, Danny Segev

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1150334.1150341

zbMATH Keywords

approximation algorithmsdecompositionrobust optimizationspanning trees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Algorithm Theory - SWAT 2004
• \(k\)-edge subgraph problems
• Finding the Minimum-Weight k-Path
• scientific article; zbMATH DE number 437549
• A note on the robust 1-center problem on trees

Cited in

(5)

• The Exact Subgraph Recoverable Robust Shortest Path Problem
• Tree robustness of a graph
• Robust randomized matchings
• Algorithm Theory - SWAT 2004
• Robust independence systems

This page was built for publication: Robust subgraphs for trees and paths

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