A Faster, Better Approximation Algorithm for the Minimum Latency Problem (Q3532573): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:27, 5 February 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
