The internal Steiner tree problem: Hardness and approximations (Q1931427): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jco.2012.08.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967576404 / rank | |||
Normal rank | |||
Latest revision as of 21:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The internal Steiner tree problem: Hardness and approximations |
scientific article |
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
