Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1537804457 / rank | |||
Normal rank | |||
Revision as of 20:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements |
scientific article |
Statements
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (English)
0 references
12 February 2009
0 references
