Approximation Algorithms for a Network Design Problem (Q5323067): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A matching problem with side conditions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4763416 / 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: An approximation algorithm for network design problems with downwards-monotone demand functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank | |||
Normal rank | |||
Latest revision as of 20:22, 1 July 2024
scientific article; zbMATH DE number 5585623
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for a Network Design Problem |
scientific article; zbMATH DE number 5585623 |
Statements
Approximation Algorithms for a Network Design Problem (English)
0 references
23 July 2009
0 references
0 references
