Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance

DOI10.1016/0166-218X(92)90009-YzbMath0774.68064MaRDI QIDQ1208455

Yu-Tai Ching, Ming-Tat Ko

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

location problems\(m\)-center problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

A simple linear algorithm for computing rectilinear 3-centers

Cites Work

• Unnamed Item
• On weighted rectilinear 2-center and 3-center problems
• Rectilinear m -Center problem
• The Weighted Euclidean 1-Center Problem
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
• On the rectangularp-center problem
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance