Minimum-diameter covering problems (Q4520238)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum-diameter covering problems |
scientific article; zbMATH DE number 1542606
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-diameter covering problems |
scientific article; zbMATH DE number 1542606 |
Statements
3 December 2001
0 references
graph diameter
0 references
covering problems
0 references
NP-complete
0 references
approximation algorithms
0 references
multiple-choice
0 references
distance
0 references
polynomial time algorithms
0 references
Minimum-diameter covering problems (English)
0 references
