Revisiting Garg's 2-approximation algorithm for the \(k\)-MST problem in graphs (Q6539113)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Revisiting Garg's 2-approximation algorithm for the \(k\)-MST problem in graphs |
scientific article; zbMATH DE number 7848491
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisiting Garg's 2-approximation algorithm for the \(k\)-MST problem in graphs |
scientific article; zbMATH DE number 7848491 |
Statements
Revisiting Garg's 2-approximation algorithm for the \(k\)-MST problem in graphs (English)
0 references
14 May 2024
0 references
