Robust subgraphs for trees and paths

DOI10.1145/1150334.1150341zbMath1321.68506OpenAlexW2029846150MaRDI QIDQ2944516

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

decompositionrobust optimizationapproximation algorithmsspanning trees

Mathematics Subject Classification ID

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

Related Items (2)

Robust Independence Systems ⋮ Robust Randomized Matchings

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