Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Analysis of Algorithm
Subscribe
Academic
Publications
Computing minimum diameter color-spanning sets is hard
Edit
Computing minimum diameter color-spanning sets is hard
BibTex
|
RIS
|
RefWorks
Download
Rudolf Fleischer
,
Xiaoming Xu
We show that the minimum diameter color-spanning set problem is NP-hard for Lp metric, 1p∞.
Journal:
Information Processing Letters - IPL
, vol. 111, no. 21, pp. 1054-1056, 2011
DOI:
10.1016/j.ipl.2011.07.015
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)
Computing minimum diameter color-spanning sets is hard