Rectilinear static and dynamic discrete 2-center problems

DOI10.1007/3-540-48447-7_28MaRDI QIDQ3024786zbMATH OpenFDO

Authors Michael Segal, Sergei Bespamyatnikh

Publication date 4 July 2005

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

Full work available at URL https://doi.org/10.1007/3-540-48447-7_28

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial optimization (90C27)

Cited in

(6)

• A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation.
• Bichromatic 2-center of pairs of points
• A simple linear algorithm for computing rectilinear 3-centers
• The 1-center and 1-highway problem
• The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited
• Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position

This page was built for publication: Rectilinear static and dynamic discrete 2-center problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024786)