An 11/6-approximation algorithm for the network Steiner problem (Q2366230): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On efficient implementation of an approximation algorithm for the Steiner tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for Steiner trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Steiner problem in networks: A survey / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01187035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012130001 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An 11/6-approximation algorithm for the network Steiner problem |
scientific article |
Statements
An 11/6-approximation algorithm for the network Steiner problem (English)
0 references
29 June 1993
0 references
approximation algorithm
0 references
network Steiner problem
0 references
minimum cost Steiner tree
0 references
