Geometric complexity of some location problems
From MaRDI portal
Publication:1099951
DOI10.1007/BF01840442zbMath0639.68038MaRDI QIDQ1099951
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET, Linear approximation of simple objects, Computing the minimum Hausdorff distance between two point sets on a line under translation, An efficient parallel sorting algorithm, Locational optimization problems solved through Voronoi diagrams, Median hyperplanes in normed spaces -- a survey, Special issue on Locational analysis, Location of rectilinear center trajectories, Solving restricted line location problems via a dual interpretation, A comment on a minmax location problem, Heuristics for parallel machine scheduling with delivery times, \(k\) best cuts for circular-arc graphs, A near-linear algorithm for the planar segment-center problem, Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications