How to trim a MST
From MaRDI portal
Publication:3189057
DOI10.1145/2151171.2151179zbMath1295.68215OpenAlexW1974759992MaRDI QIDQ3189057
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2151171.2151179
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Approximating the Minimum Tour Cover with a Compact Linear Program ⋮ Graph covering using bounded size subgraphs ⋮ Multi-rooted greedy approximation of directed Steiner trees with applications
This page was built for publication: How to trim a MST
