Improved Guarantees for Tree Cut Sparsifiers
From MaRDI portal
Publication:2921461
DOI10.1007/978-3-662-44777-2_64zbMath1425.05156OpenAlexW295352820MaRDI QIDQ2921461
Publication date: 8 October 2014
Published in: Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_64
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items (3)
Mean isoperimetry with control on outliers: exact and approximation algorithms ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
This page was built for publication: Improved Guarantees for Tree Cut Sparsifiers
