Finding a region with the minimum total \(L_1\) distance from prescribed terminals

DOI10.1007/s00453-002-0997-yzbMath1045.68158OpenAlexW1996665742MaRDI QIDQ1400886

Takao Nishizeki, Yoshiyuki Kusakari

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0997-y

zbMATH Keywords

axis-parallel rectangular obstacles on the plane

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Planar location problems with block distance and barriers

This page was built for publication: Finding a region with the minimum total \(L_1\) distance from prescribed terminals