Pages that link to "Item:Q2414116"
From MaRDI portal
The following pages link to A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116):
Displaying 4 items.
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)