Computing minimum diameter color-spanning sets is hard (Q1944200)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6150489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum diameter color-spanning sets is hard |
scientific article; zbMATH DE number 6150489 |
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
