On bicriterion minimal spanning trees: An approximation (Q1360130)
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: On bicriterion minimal spanning trees: An approximation |
scientific article; zbMATH DE number 1034144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On bicriterion minimal spanning trees: An approximation |
scientific article; zbMATH DE number 1034144 |
Statements
On bicriterion minimal spanning trees: An approximation (English)
0 references
15 July 1997
0 references
set of efficient spanning trees
0 references
heuristics
0 references
neighbourhood search
0 references
adjacent search
0 references
0.8399492502212524
0 references
0.8169820308685303
0 references
0.790962278842926
0 references
