Pages that link to "Item:Q1566960"
From MaRDI portal
The following pages link to Recent results on approximating the Steiner tree problem and its generalizations (Q1566960):
Displaying 8 items.
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Social enterprise tree network games (Q1622035) (← links)
- Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation (Q1881568) (← links)
- A note on Steiner tree games (Q2892158) (← links)
- (Q4945797) (← links)
- (Q5480276) (← links)