Pages that link to "Item:Q3009752"
From MaRDI portal
The following pages link to Approximability of Capacitated Network Design (Q3009752):
Displayed 5 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- The minimum vulnerability problem (Q487032) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)