Approximation algorithms for orthogonal line centers

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 (53,32) bi-criteria approximation algorith...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 338; pp. 69 - 76
Main Authors: Das, Arun Kumar, Das, Sandip, Mukherjee, Joydeep
Format: Journal Article
Language:English
Published: Elsevier B.V 30.10.2023
Subjects:
Bi-criteria approximation
Combinatorial optimization
Facility location
Geometric optimization
Orthogonal line centers
Facility location
Geometric optimization
Combinatorial optimization
Bi-criteria approximation
Orthogonal line centers
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 (53,32) 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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2023.05.014