An 11/6-approximation algorithm for the network Steiner problem (Q2366230): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 17:10, 17 May 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
