Back to Search
Start Over
Approximation algorithms for orthogonal line centers.
- Source :
-
Discrete Applied Mathematics . Oct2023, Vol. 338, p69-76. 8p. - Publication Year :
- 2023
-
Abstract
- The problem of k orthogonal line center is about computing a set of k axis-parallel lines for a given set of points in ℜ 2 such that the maximum among the distances between each point to its nearest line is minimized. A 2-factor approximation algorithm and a (5 3 , 3 2) bi-criteria approximation algorithm is presented for the problem. Both of them are deterministic approximation algorithms using combinatorial techniques and having sub-quadratic running times. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 338
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 169704197
- Full Text :
- https://doi.org/10.1016/j.dam.2023.05.014