Geometric p-Center Problems with Centers Constrained to Two Lines

DOI10.1007/978-3-319-48532-4_3zbMath1425.68425arXiv1512.07533OpenAlexW2214712246MaRDI QIDQ2958084

Yuya Higashikawa, Tsunehiko Kameda, Sandip Das, Ante Ćustić, Naoki Katoh, Binay K. Bhattacharya

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.07533

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the one-dimensional \(k\)-center problem
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• A deterministic algorithm for fitting a step function to a weighted point-set
• Some variations on constrained minimum enclosing circle problem
• Optimizing Squares Covering a Set of Points
• Line-Constrained $$k$$ -Median, $$k$$ -Means, and $$k$$ -Center Problems in the Plane
• The Weighted Euclidean 1-Center Problem
• On the Complexity of Some Common Geometric Location Problems
• 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
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Sorting in Average Time $o(\log \,n)$
• Slowing down sorting networks to obtain faster sorting algorithms
• Finding kth paths and p-centers by generating and searching good data structures