Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627)
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: Local search for the minimum label spanning tree problem with bounded color classes. |
scientific article; zbMATH DE number 1929384
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search for the minimum label spanning tree problem with bounded color classes. |
scientific article; zbMATH DE number 1929384 |
Statements
Local search for the minimum label spanning tree problem with bounded color classes. (English)
0 references
17 June 2003
0 references
Graph algorithms
0 references
Approximation algorithms
0 references
Combinatorial optimization
0 references
Local search
0 references
Complexity
0 references
APX-completeness
0 references
0.9103939
0 references
0.8905318
0 references
0.8753607
0 references
0.8709726
0 references
0.87071526
0 references
0.86983424
0 references
0.86899996
0 references
0 references
