Fault-Tolerant Covering Problems in Metric Spaces

In this article, we study some fault-tolerant covering problems in metric spaces. In the metric multi-cover problem (MMC), we are given two point sets Y (servers) and X (clients) in an arbitrary metric space ( X ∪ Y , d ) , a positive integer k that represents the coverage demand of each client, and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2021-02, Vol.83 (2), p.413-446
Hauptverfasser:	Bhowmick, Santanu, Inamdar, Tanmay, Varadarajan, Kasturi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Fault tolerance Integers Mathematics of Computing Metric space Servers Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!