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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 338; S. 69 - 76
Hauptverfasser:	Das, Arun Kumar, Das, Sandip, Mukherjee, Joydeep
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 30.10.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!