A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (Q4512573): Difference between revisions
From MaRDI portal
Created a new 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.2000.1096 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2610052675 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:02, 19 March 2024
scientific article; zbMATH DE number 1525509
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem |
scientific article; zbMATH DE number 1525509 |
Statements
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (English)
0 references
5 November 2000
0 references
network design
0 references
Steiner tree
0 references
randomized algorithm
0 references
