Pages that link to "Item:Q699765"
From MaRDI portal
The following pages link to Approximation algorithms for access network design (Q699765):
Displayed 4 items.
- Approximating some network design problems with node costs (Q638508) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)