Approximating Some Network Design Problems with Node Costs (Q3638881): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Guy Kortsarz / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Zeev Nutov / rank | |||
Normal rank | |||
Revision as of 10:37, 12 February 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
