The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-92702-8_6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4205472357 / rank | |||
Normal rank | |||
Revision as of 21:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling \(k\)-median problem: approximating optimal network coverage |
scientific article |
Statements
The traveling \(k\)-median problem: approximating optimal network coverage (English)
0 references
19 October 2022
0 references
\(k\)-median problem
0 references
network coverage
0 references
routing over time
0 references
approximation algorithms
0 references
