Constrained k-Center Problem on a Convex Polygon

DOI10.1142/S0129054120500070zbMath1458.68262OpenAlexW3011135041MaRDI QIDQ5859739

Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das

Publication date: 20 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120500070

zbMATH Keywords

approximation algorithmconvex polygon covergeometric disk cover

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (3)

The Euclidean \(k\)-supplier problem in \(I R^2\) ⋮ Covering convex polygons by two congruent disks ⋮ Covering convex polygons by two congruent disks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Base station placement on boundary of a convex polygon
• Constrained \(k\)-center and movement to independence
• Clustering to minimize the maximum intercluster distance
• Exact and approximation algorithms for clustering
• Some variations on constrained minimum enclosing circle problem
• An approximation algorithm for \(k\)-center problem on a convex polygon
• The searching over separators strategy to solve some NP-hard problems in subexponential time
• The 2-Center Problem with Obstacles
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• A Best Possible Heuristic for the k-Center Problem
• The p-center location problem in an area

This page was built for publication: Constrained k-Center Problem on a Convex Polygon