Approximating Some Network Design Problems with Node Costs (Q3638881): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087756717 / rank | |||
Normal rank | |||
Latest revision as of 23:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Some Network Design Problems with Node Costs |
scientific article |
Statements
Approximating Some Network Design Problems with Node Costs (English)
0 references
28 October 2009
0 references
network design
0 references
node costs
0 references
multicommodity buy at bulk
0 references
covering tree
0 references
approximation algorithm
0 references
hardness of approximation
0 references
