Revisiting Garg's 2-approximation algorithm for the k-MST problem in graphs

DOI10.1137/1.9781611977585.CH6MaRDI QIDQ6539113zbMATH OpenFDO

Authors Emmett Breen, Renee Mirka, Zichen Wang, David P. Williamson

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977585.CH6

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Approximation algorithms for the generalized point-to-point problem

This page was built for publication: Revisiting Garg's 2-approximation algorithm for the \(k\)-MST problem in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539113)