Faster algorithms for some optimization problems on collinear points
From MaRDI portal
Publication:5115775
Recommendations
Cites work
- Algorithms – ESA 2005
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Faster algorithms for some optimization problems on collinear points
- Minimum-cost coverage of point sets by disks
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Range assignment of base-stations maximizing coverage area without interference
- The minimum-area spanning tree problem
Cited in
(10)- Algorithms for the line-constrained disk coverage and related problems
- Algorithms for the line-constrained disk coverage and related problems
- On line-separable weighted unit-disk coverage and related problems
- Faster algorithms for some optimization problems on collinear points
- Faster algorithms for some optimization problems on collinear points
- On the line-separable unit-disk coverage and related problems
- On line-separable weighted unit-disk coverage and related problems
- Range assignment of base-stations maximizing coverage area without interference
- On the line-separable unit-disk coverage and related problems
- Maximum centre-disjoint mergeable disks
This page was built for publication: Faster algorithms for some optimization problems on collinear points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115775)