Approximation algorithms for hitting objects with straight lines
- 1 January 1991
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 30 (1), 29-42
- https://doi.org/10.1016/0166-218x(91)90011-k
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the complexity of polyhedral separabilityDiscrete & Computational Geometry, 1988
- An algorithm for planning stereotactic brain implantsInternational Journal of Radiation Oncology*Biology*Physics, 1987
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- On the complexity of locating linear facilities in the planeOperations Research Letters, 1982
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974