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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 85; no. 7; pp. 1883 - 1911
Main Authors:	Kim, Kangsan, Shin, Yongho, An, Hyung-Chan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2023 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!