IDEAS home Printed from https://ideas.repec.org/a/spr/advdac/v16y2022i4d10.1007_s11634-021-00481-4.html
   My bibliography  Save this article

Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space

Author

Listed:
  • Vladimir Shenmaier

    (Sobolev Institute of Mathematics)

Abstract

Many geometric optimization problems can be reduced to choosing points in space (centers) minimizing some objective function which continuously depends on the distances from the chosen centers to given input points. We prove that, for any fixed $$\varepsilon >0$$ ε > 0 , every finite set of points in any-dimensional real space admits a polynomial-size set of candidate centers which can be computed in polynomial time and which contains a $$(1+\varepsilon )$$ ( 1 + ε ) -approximation of each point of space with respect to the Euclidean distances to all the given points. It provides a universal approximation-preserving reduction of any geometric center-based problems whose objective function satisfies a natural continuity-type condition to their discrete versions where the desired centers are selected from a polynomial-size set of candidates. The obtained polynomial upper bound for the size of a universal centers set is supplemented by a theoretical lower bound for this size in the worst case.

Suggested Citation

  • Vladimir Shenmaier, 2022. "Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 16(4), pages 1039-1067, December.
    • Handle: RePEc:spr:advdac:v:16:y:2022:i:4:d:10.1007_s11634-021-00481-4
    DOI: 10.1007/s11634-021-00481-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11634-021-00481-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11634-021-00481-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. William Cook & André Rohe, 1999. "Computing Minimum-Weight Perfect Matchings," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 138-148, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. D Briskorn & A Drexl, 2009. "A branch-and-price algorithm for scheduling sport leagues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 84-93, January.
    2. Alberto Caprara & Giuseppe Lancia & See-Kiong Ng, 2001. "Sorting Permutations by Reversals Through Branch-and-Price," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 224-244, August.
    3. Xu, Zhou & Rodrigues, Brian, 2017. "An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 735-745.
    4. Fekete, Sandor P. & van der Veen, Jan C., 2007. "PackLib2: An integrated library of multi-dimensional packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1131-1135, December.
    5. Kevin K. H. Cheung & Kyel Governor, 2023. "A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming," Journal of Combinatorial Optimization, Springer, vol. 45(3), pages 1-27, April.
    6. Chris Walshaw, 2002. "A Multilevel Approach to the Travelling Salesman Problem," Operations Research, INFORMS, vol. 50(5), pages 862-877, October.
    7. F. Liers & G. Pardella, 2012. "Partitioning planar graphs: a fast combinatorial approach for max-cut," Computational Optimization and Applications, Springer, vol. 51(1), pages 323-344, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:advdac:v:16:y:2022:i:4:d:10.1007_s11634-021-00481-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.