Pages that link to "Item:Q5896928"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896928):
Displaying 12 items.
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
- A note on the minimum power partial cover problem on the plane (Q2165259) (← links)
- A PTAS for the disk cover problem of geometric objects (Q2450711) (← links)
- Fault-tolerant covering problems in metric spaces (Q2659766) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
- Multi Cover of a Polygon Minimizing the Sum of Areas (Q3078391) (← links)
- Automata, Languages and Programming (Q5716841) (← links)
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
- PTAS for minimum cost multicovering with disks (Q6593767) (← links)