Computing minimum diameter color-spanning sets is hard (Q1944200): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q537642 |
||
| Property / author | |||
| Property / author: Xiao-Ming Xu / rank | |||
Revision as of 03:44, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing minimum diameter color-spanning sets is hard |
scientific article |
Statements
Computing minimum diameter color-spanning sets is hard (English)
0 references
4 April 2013
0 references
analysis of algorithms
0 references
NP hardness
0 references
minimum diameter color-spanning disk
0 references
