A polynomial time approximation scheme for the grade of service Steiner minimum tree problem (Q1810876)
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: A polynomial time approximation scheme for the grade of service Steiner minimum tree problem |
scientific article; zbMATH DE number 1924952
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time approximation scheme for the grade of service Steiner minimum tree problem |
scientific article; zbMATH DE number 1924952 |
Statements
A polynomial time approximation scheme for the grade of service Steiner minimum tree problem (English)
0 references
9 June 2003
0 references
Approximation algorithms
0 references
Rectangular partitions
0 references
Grade of service Steiner minimum tree
0 references
Network design
0 references
