Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions

DOI10.1007/978-3-030-58657-7_10zbMATH Open1460.90183OpenAlexW3084574914MaRDI QIDQ4965103FDOQ4965103

Authors: Vladimir Shenmaier 

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_10

Recommendations

• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
• Linear-size universal discretization of geometric center-based problems in fixed dimensions
• Solving the discrete \(l_p\)-approximation problem by a method of centers
• Discretization and affine approximation in high dimensions
• The generalized discrete ‐centroid problem
• scientific article; zbMATH DE number 2079186
• An exact method for the discrete \((r|p)\)-centroid problem
• An optimal generalization of the centerpoint theorem, and its extensions
• Generalizations of the centroid with an application in stochastic geometry

zbMATH Keywords

high dimensionsEuclidean spacegeometric clusteringcontinuous facility locationapproximate centers

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Exact and approximation algorithms for clustering
• Iterated nearest neighbors and finding minimal polytopes
• Finding k points with minimum diameter and related problems
• Title not available (Why is that?)
• Linear-time approximation schemes for clustering problems in any dimensions
• Clustering through continuous facility location problems
• Approximate clustering via core-sets
• On coresets for k-means and k-median clustering
• On k-Median clustering in high dimensions
• Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
• Approximate minimum enclosing balls in high dimensions using core-sets
• Title not available (Why is that?)
• An approximation scheme for a problem of search for a vector subset
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
• The problem of a minimal ball enclosing k points
• Faster algorithms for the constrained \(k\)-means problem
• A unified framework for clustering constrained data without locality property
• Complexity and approximation of the smallest \(k\)-enclosing ball problem

Cited In (3)

• Approximation and complexity of the capacitated geometric median problem
• Linear-size universal discretization of geometric center-based problems in fixed dimensions
• Title not available (Why is that?)

This page was built for publication: Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965103)