Pages that link to "Item:Q1759660"
From MaRDI portal
The following pages link to Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660):
Displaying 9 items.
- Improved approximation algorithms for geometric set cover (Q866970) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Universal approximations for TSP, Steiner tree, and set cover (Q3581400) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
- Algorithms of optimal set covering on the planar R^2 (Q5266487) (← links)
- Improved approximation algorithms for geometric set cover (Q5370605) (← links)
- Capacitated discrete unit disk cover (Q5918931) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)