What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179): Difference between revisions
From MaRDI portal
Latest revision as of 20:31, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs |
scientific article |
Statements
What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (English)
0 references
24 July 2009
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
minimum spanning trees
0 references
matching
0 references