Polynomial time approximation scheme for the rectilinear Steiner arborescence problem (Q1587590)
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 1538193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time approximation scheme for the rectilinear Steiner arborescence problem |
scientific article; zbMATH DE number 1538193 |
Statements
Polynomial time approximation scheme for the rectilinear Steiner arborescence problem (English)
0 references
7 October 2001
0 references
PTAS
0 references
arborescence
0 references
Steiner terminals
0 references
VLSI design
0 references
approximation algorithm
0 references
0.97949183
0 references
0.9461436
0 references
0.93302244
0 references
0.93302244
0 references
0.92498887
0 references
0.9214566
0 references
0.92019904
0 references
