Computing the Line-Constrained k-center in the Plane for Small k

DOI10.1007/978-3-319-41168-2_17zbMath1476.68288OpenAlexW2477645395MaRDI QIDQ2830071

Hung-Lung Wang, Kun-Mao Chao, Albert Jhih-Heng Huang

Publication date: 9 November 2016

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41168-2_17

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Related Items (1)

The connected disk covering problem

Cites Work

• Unnamed Item
• The discrete 2-center problem
• Some variations on constrained minimum enclosing circle problem
• More planar two-center algorithms
• A simple linear algorithm for computing rectilinear 3-centers
• THE ALIGNED K-CENTER PROBLEM
• On the Complexity of Some Common Geometric Location Problems
• An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
• Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

This page was built for publication: Computing the Line-Constrained k-center in the Plane for Small k