An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating minimum-cost graph problems with spanning tree edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A greedy heuristic for a minimum-weight forest problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Another greedy heuristic for the constrained forest problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank | |||
Normal rank | |||
Latest revision as of 11:42, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for network design problems with downwards-monotone demand functions |
scientific article |
Statements
An approximation algorithm for network design problems with downwards-monotone demand functions (English)
0 references
11 June 2008
0 references
spanning forests
0 references
integer programs
0 references
