The internal Steiner tree problem: Hardness and approximations (Q1931427)
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 internal Steiner tree problem: Hardness and approximations |
scientific article; zbMATH DE number 6125279
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The internal Steiner tree problem: Hardness and approximations |
scientific article; zbMATH DE number 6125279 |
Statements
The internal Steiner tree problem: Hardness and approximations (English)
0 references
14 January 2013
0 references
VLSI routing
0 references
approximation algorithms
0 references
MAX SNP-hardness
0 references
Steiner trees
0 references
the internal Steiner tree problem
0 references
design and analysis of algorithms
0 references
0 references
0.9365201
0 references
0.9114762
0 references
0.91095775
0 references
0.90778047
0 references
0.9027581
0 references
0.8989682
0 references
