Pages that link to "Item:Q868154"
From MaRDI portal
The following pages link to New primal-dual algorithms for Steiner tree problems (Q868154):
Displaying 5 items.
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- Subjectively interesting connecting trees and forests (Q2218354) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
