Algorithms for a network design problem with crossing supermodular demands (Q4474300): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4250182 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3128880 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Biconnectivity approximations and graph carvings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4527015 / rank | |||
Normal rank | |||
Latest revision as of 18:33, 6 June 2024
scientific article; zbMATH DE number 2081230
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for a network design problem with crossing supermodular demands |
scientific article; zbMATH DE number 2081230 |
Statements
Algorithms for a network design problem with crossing supermodular demands (English)
0 references
4 August 2004
0 references
network design problems
0 references
crossing supermodular functions
0 references
approximation algorithms
0 references
linear programming
0 references
basic solutions
0 references
