Bounded fan-out \(m\)-center problem

DOI10.1016/S0020-0190(97)00104-XzbMath1337.68131OpenAlexW2064125774MaRDI QIDQ287146

Ming-Tat Ko, Jan-Ming Ho

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00104-x

zbMATH Keywords

analysis of algorithmscomputational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Related Items (1)

A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation.

Cites Work

• An optimal approximation algorithm for the rectilinear m-center problem
• On the Complexity of Some Common Geometric Location Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Finding kth paths and p-centers by generating and searching good data structures
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded fan-out \(m\)-center problem