A Faster, Better Approximation Algorithm for the Minimum Latency Problem (Q3532573)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5358295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Faster, Better Approximation Algorithm for the Minimum Latency Problem |
scientific article; zbMATH DE number 5358295 |
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
0.8713510036468506
0 references
0.8655855655670166
0 references
