A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01299747 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4385007144 / rank | |||
Normal rank | |||
Latest revision as of 10:20, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A primal-dual approximation algorithm for generalized Steiner network problems |
scientific article |
Statements
A primal-dual approximation algorithm for generalized Steiner network problems (English)
0 references
17 October 1995
0 references
polynomial-time approximation algorithm
0 references
minimum-cost subgraph
0 references
generalized Steiner network problem
0 references
survivable network design
0 references
