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

Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center

descriptionPublicationkeyboard_double_arrow_right Article 20 Dec 2022 English Publisher:Springer Science and Business Media LLCJournal:Algorithmica, volume 85, pages 1,883-1,911 (issn: 0178-4617, eissn: 1432-0541,

Authors: Kangsan Kim; Yongho Shin; Hyung-Chan An;

doi: 10.1007/s00453-022-01060-5

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

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Yonsei University
Korea (Republic of)

Keywords

parity constraints, Discrete location and assignment, \(k\)-center, clustering problems, approximation algorithms, Approximation methods and heuristics in mathematical programming, Approximation algorithms, facility location problems

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	5
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%