Robust subgraphs for trees and paths

DOI10.1145/1150334.1150341zbMATH Open1321.68506OpenAlexW2029846150MaRDI QIDQ2944516FDOQ2944516

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

spanning treesdecompositionapproximation algorithmsrobust optimization

Mathematics Subject Classification ID

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

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)

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

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)