Assigning weights to minimize the covering radius in the plane

DOI10.1016/j.comgeo.2018.10.007zbMath1433.62339OpenAlexW2921949743WikidataQ128267308 ScholiaQ128267308MaRDI QIDQ2331208

Hee-Kap Ahn, Eunjin Oh

Publication date: 25 October 2019

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6827/

zbMATH Keywords

covering radiusminimum radiusweighted distanceweighted centerweight assignment

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Statistics on metric spaces (62R20)

Cites Work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Inverse 1-center location problems with edge length augmentation on trees
• On the ball spanned by balls
• Some reverse location problems
• The complexity analysis of the inverse center location problem
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Linear Programming in Linear Time When the Dimension Is Fixed
• Parallel Merge Sort
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Improving the location of minimax facilities through network modification
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
• Weight Balancing on Boundaries and Skeletons

This page was built for publication: Assigning weights to minimize the covering radius in the plane