What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179)
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: What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs |
scientific article; zbMATH DE number 5586534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs |
scientific article; zbMATH DE number 5586534 |
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
0 references
0.9622830152511596
0 references
0.8833184838294983
0 references
0.8599749207496643
0 references
0.8579152226448059
0 references
