Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
From MaRDI portal
Publication:5860477
DOI10.1137/19M126918XOpenAlexW3207977933MaRDI QIDQ5860477
Publication date: 19 November 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m126918x
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Paths and cycles (05C38) Approximation algorithms (68W25)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for the traveling repairman problem with profits
- An improved approximation ratio for the minimum latency problem
- News from the online traveling repairman.
- Approximation schemes for NP-hard geometric optimization problems: a survey
- On the approximability of average completion time scheduling under precedence constraints.
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Approximating min sum set cover
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Approximation algorithms for minimizing average distortion
- The minimum latency problem
- Approximation schemes for minimum latency problems
- On the Approximability of Single-Machine Scheduling with Precedence Constraints
- A subset spanner for Planar graphs, with application to subset TSP
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- A Faster, Better Approximation Algorithm for the Minimum Latency Problem
- The Directed Minimum Latency Problem
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
- The complexity of the travelling repairman problem
- Special cases of traveling salesman and repairman problems with time windows
- Complexity of Scheduling under Precedence Constraints
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximation Schemes for Minimum Latency Problems
- A note on the traveling repairman problem
- Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
This page was built for publication: Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
