Pages that link to "Item:Q2080830"
From MaRDI portal
The following pages link to A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830):
Displaying 12 items.
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- A note on the minimum power partial cover problem on the plane (Q2165259) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Online mixed ring covering problem with two nodes (Q2677362) (← links)
- Prize‐collecting set multicovering with submodular pricing (Q5374518) (← links)
- An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees (Q6111962) (← links)
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
- Energy-constrained geometric coverage problem (Q6167018) (← links)
- An approximation algorithm for the minimum soft capacitated disk multi-coverage problem (Q6535281) (← links)
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem (Q6535282) (← links)
- \(W\)-prize-collecting scheduling problem on parallel machines (Q6646746) (← links)