Minimum-diameter covering problems (Q4520238): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Minimum-diameter covering problems | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/1097-0037(200010)36:3<147::aid-net1>3.0.co;2-m / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089712558 / rank | |||
Normal rank | |||
| Property / title | |||
Minimum-diameter covering problems (English) | |||
| Property / title: Minimum-diameter covering problems (English) / rank | |||
Normal rank | |||
Latest revision as of 08:49, 30 July 2024
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
