Hardness of robust network design (Q3593369): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2788302603 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simpler and better approximation algorithms for network design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Provisioning a virtual private network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the power of unique 2-prover 1-round games / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks / rank | |||
Normal rank | |||
Latest revision as of 12:37, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of robust network design |
scientific article |
Statements
Hardness of robust network design (English)
0 references
20 July 2007
0 references
network design
0 references
single-source hose model
0 references
robust optimization
0 references
