Pages that link to "Item:Q2421447"
From MaRDI portal
The following pages link to A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447):
Displaying 7 items.
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
- An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937) (← links)
- A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
- An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)
- \(W\)-prize-collecting scheduling problem on parallel machines (Q6646746) (← links)
