Approximation algorithms for orthogonal line centers
Article Type
Research Article
Publication Title
Discrete Applied Mathematics
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 ([Formula presented] 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.
First Page
69
Last Page
76
DOI
https://10.1016/j.dam.2023.05.014
Publication Date
10-30-2023
Recommended Citation
Das, Arun Kumar; Das, Sandip; and Mukherjee, Joydeep, "Approximation algorithms for orthogonal line centers" (2023). Journal Articles. 3531.
https://digitalcommons.isical.ac.in/journal-articles/3531
