The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596)
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: The partial sum criterion for Steiner trees in graphs and shortest paths |
scientific article; zbMATH DE number 1253156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The partial sum criterion for Steiner trees in graphs and shortest paths |
scientific article; zbMATH DE number 1253156 |
Statements
The partial sum criterion for Steiner trees in graphs and shortest paths (English)
0 references
22 February 1999
0 references
partial sum criterion
0 references
minmax Steiner tree problem
0 references
bottleneck shortest path
0 references
bottleneck spanning tree
0 references
0 references
0.7856601476669312
0 references
0.7834988236427307
0 references
0.7814710736274719
0 references
