Packing Steiner Trees: Separation Algorithms (Q4881289)
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: Packing Steiner Trees: Separation Algorithms |
scientific article; zbMATH DE number 894063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing Steiner Trees: Separation Algorithms |
scientific article; zbMATH DE number 894063 |
Statements
Packing Steiner Trees: Separation Algorithms (English)
0 references
3 October 1996
0 references
dual graph
0 references
multicuts
0 references
Steiner tree packing problem
0 references
routing
0 references
switchbox routing
0 references
separation
0 references
shortest path
0 references
0.8886723518371582
0 references
0.8690893054008484
0 references
0.8579727411270142
0 references
