Pages that link to "Item:Q3595372"
From MaRDI portal
The following pages link to Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees (Q3595372):
Displaying 7 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- One tree suffices: a simultaneous \(O(1)\)-approximation for single-sink buy-at-bulk (Q2913815) (← links)
- Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees (Q2954999) (← links)
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph (Q3104595) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)