Computing minimum diameter color-spanning sets is hard
type: Item
instance of: scholarly article
title: Computing minimum diameter color-spanning sets is hard
zbMATH Open document ID: 1260.68153
author: Rudolf Fleischer
author: Xiaoming Xu
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6150489
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: NP hardness
zbMATH Keywords: minimum diameter color-spanning disk
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.07.015
OpenAlex ID: W2054933178
cites work: Q4796181
cites work: On Some Geometric Problems of Color-Spanning Sets
cites work: Computing Minimum Diameter Color-Spanning Sets
DOI: 10.1016/J.IPL.2011.07.015
description: scientific article; zbMATH DE number 6150489