A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
From MaRDI portal
Publication:5874522
Cites work
- scientific article; zbMATH DE number 871952 (Why is no real title available?)
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- An improved approximation algorithm for ATSP
- Approximating minimum-cost graph problems with spanning tree edges
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Asymmetric traveling salesman path and directed latency problems
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
- Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- Linear programming-based approximation algorithms for multi-vehicle minimum latency problems (extended abstract)
- List Scheduling in Order of α-Points on a Single Machine
- On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- The Delivery Man Problem and Cumulative Matroids
- The Directed Minimum Latency Problem
- The complexity of the travelling repairman problem
- The delivery man problem on a tree network
- The minimum latency problem
- The school bus routing problem: a review
- The vehicle routing problem
This page was built for publication: A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874522)
