On the complexity of locating linear facilities in the plane
type: Item
instance of: scholarly article
title: On the complexity of locating linear facilities in the plane
zbMATH Open document ID: 0507.90025
DOI: 10.1016/0167-6377(82)90039-6
author: Nimrod Megiddo
author: Arie Tamir
published in: Operations Research Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3801265
zbMATH Keywords: p-line centre
zbMATH Keywords: p-line median
zbMATH Keywords: NP-completeness
zbMATH Keywords: computational complexity
zbMATH Keywords: linear facility location in the plane
zbMATH Keywords: NP-hardness in the strong sense
Wikidata QID: Q29397008
MaRDI profile type: Publication
full work available at URL: 0167-6377(82)90039-6
OpenAlex ID: W2027402472
cites work: Q4131987
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Q4198056
cites work: Q5514221
cites work: Finding Least-Distances Lines
cites work: Q5669010
cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem
DBLP publication ID: journals/orl/MegiddoT82
description: scientific article; zbMATH DE number 3801265