Heuristics with Constant Error Guarantees for the Design of Tree Networks (Q3780780)
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 4043642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics with Constant Error Guarantees for the Design of Tree Networks |
scientific article; zbMATH DE number 4043642 |
Statements
Heuristics with Constant Error Guarantees for the Design of Tree Networks (English)
0 references
1988
0 references
network design
0 references
spanning tree network of minimum length
0 references
NP-complete
0 references
efficient heuristic
0 references
partitioning of a traveling salesman tour
0 references
0.8816115856170654
0 references
0.8782845735549927
0 references
0.8396439552307129
0 references