The following pages link to On fixed cost \(k\)-flow problems (Q260248):
Displaying 4 items.
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem (Q3046506) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6663517) (← links)