Low degree spanning trees of small weight

DOI10.1145/195058.195212zbMath1345.90077OpenAlexW1973264741MaRDI QIDQ2817632

Neal E. Young, Balaji Raghavachari, Samir Khuller

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (4)

On the approximability of some maximum spanning tree problems ⋮ On the approximability of some Maximum Spanning Tree Problems ⋮ A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees ⋮ On improved bounds for bounded degree spanning trees for points in arbitrary dimension

This page was built for publication: Low degree spanning trees of small weight