Polynomial algorithms for restricted Euclidean p-centre problems

DOI10.1016/0166-218X(89)90032-2zbMath0666.68036OpenAlexW1970240082MaRDI QIDQ1116694

Mark J. Keil, Larry Aupperle

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0166-218x(89)90032-2

zbMATH Keywords

NP-hardcomputational geometryp-centre problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)

Cites Work

• On the Complexity of Some Common Geometric Location Problems
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• Finding kth paths and p-centers by generating and searching good data structures

This page was built for publication: Polynomial algorithms for restricted Euclidean p-centre problems