Hitting or avoiding balls in Euclidean space

DOI10.1023/A:1018901600127zbMath0880.90114MaRDI QIDQ1357768

Toshihide Ibaraki, Yves Cramer

Publication date: 16 June 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

algorithmic complexityNP-hardtight lower and upper boundsgeometric problemsballs in Euclidean space

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: Hitting or avoiding balls in Euclidean space