A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks

The main contribution of this paper is the first constant factor approximation algorithm for red-blue set cover problem with unit disks. To achieve this, we first give a polynomial time algorithm for line-separable red-blue set cover problem with unit disks. We next obtain a factor 2 approximation a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 85; H. 1; S. 100 - 132
Hauptverfasser:	Madireddy, Raghunath Reddy, Mudgal, Apurva
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2023 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Disks Mathematical analysis Mathematics of Computing Polynomials Strip Theory of Computation Sweep-line method Unit disks Strip-separable Line-separable Red–blue set cover
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!