Linear-size universal discretization of geometric center-based problems in fixed dimensions

Vladimir Shenmaier ()
Additional contact information
Vladimir Shenmaier: Sobolev Institute of Mathematics

Journal of Combinatorial Optimization, 2022, vol. 43, issue 3, No 2, 528-542

Abstract: Abstract Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are k-Means, Geometric k-Median/Center, Continuous Facility Location, m-Variance, etc. We prove that, for any fixed $$\varepsilon >0$$ ε > 0 , every set of n input points in fixed-dimensional space with the metric induced by any vector norm admits a set of O(n) candidate centers which can be computed in almost linear time and which contains a $$(1+\varepsilon )$$ ( 1 + ε ) -approximation of each point of space with respect to the distances to all the input points. It gives a universal approximation-preserving reduction of geometric center-based problems with arbitrary continuity-type objective functions to their discrete versions where the centers are selected from a fairly small set of candidates. The existence of such a linear-size set of candidates is also shown for any metric space of fixed doubling dimension.

Keywords: Geometric optimization; Clustering; Facility location; Metric space; Approximate centers; Discretization (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00790-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:43:y:2022:i:3:d:10.1007_s10878-021-00790-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00790-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().