Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center

Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under various settings reflecting typical structures within the optimization problems of practi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 85; H. 7; S. 1883 - 1911
Hauptverfasser:	Kim, Kangsan, Shin, Yongho, An, Hyung-Chan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.07.2023 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Approximation Clients Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Constraints Data Structures and Information Theory Mathematical analysis Mathematics of Computing Operations research Optimization Parity Site selection Theory of Computation Upper bounds Theory of computation Facility location and clustering Facility location problems Clustering problems Theory of computation Approximation algorithms analysis center Parity constraints Approximation algorithms
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!