Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477)
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 7430749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems |
scientific article; zbMATH DE number 7430749 |
Statements
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (English)
0 references
19 November 2021
0 references
minimum latency tour
0 references
traveling repairman
0 references
approximation algorithms
0 references
interval orders
0 references
total completion time
0 references
0 references
0 references
0 references
0.965505063533783
0 references
0.8777442574501038
0 references
0.8772029876708984
0 references
0.8223299980163574
0 references
0.8146276473999023
0 references
