Computing minimum diameter color-spanning sets is hard (Q1944200): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4796181 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Some Geometric Problems of Color-Spanning Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Minimum Diameter Color-Spanning Sets / rank | |||
Normal rank | |||
Latest revision as of 07:41, 6 July 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
