Pages that link to "Item:Q3395048"
From MaRDI portal
The following pages link to Cost-Distance: Two Metric Network Design (Q3395048):
Displaying 7 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- A review of hierarchical facility location models (Q868995) (← links)
- A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)