Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements |
scientific article; zbMATH DE number 5507781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements |
scientific article; zbMATH DE number 5507781 |
Statements
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (English)
0 references
12 February 2009
0 references
0 references
0 references
0 references
0 references
0.8841808438301086
0 references
0.8796480298042297
0 references
0.8469285368919373
0 references
0.8418624997138977
0 references
