Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds (Q5317173)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2205869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds |
scientific article; zbMATH DE number 2205869 |
Statements
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds (English)
0 references
16 September 2005
0 references
approximation algorithms
0 references
network algorithms
0 references
bicriteria approximation
0 references
spanning trees
0 references
degree-bounded spanning trees
0 references
Lagrangian relaxation
0 references
0.9911813735961914
0 references
0.9159196615219116
0 references
0.9117152690887452
0 references
0.8579152226448059
0 references
0.8433061838150024
0 references
