Pages that link to "Item:Q1327312"
From MaRDI portal
The following pages link to A primal-dual approximation algorithm for the Steiner forest problem (Q1327312):
Displaying 16 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Distributed multicast routing in point-to-point networks (Q1362952) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation (Q1881568) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs (Q1951588) (← links)
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
- (Q2753742) (← links)
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest (Q4962177) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191526) (← links)