A Faster, Better Approximation Algorithm for the Minimum Latency Problem (Q3532573): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/07068151x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009279347 / rank | |||
Normal rank | |||
Latest revision as of 10:27, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Faster, Better Approximation Algorithm for the Minimum Latency Problem |
scientific article |
Statements
A Faster, Better Approximation Algorithm for the Minimum Latency Problem (English)
0 references
28 October 2008
0 references
minimum latency problem
0 references
traveling repairman
0 references
approximation algorithm
0 references
Lagrangian relaxation
0 references
prize-collecting Steiner tree
0 references
