Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours.
François DrossKrzysztof FleszarKarol WegrzyckiAnna Zych-PawlewiczPublished in: SODA (2023)
Keyphrases
- approximation schemes
- travelling salesman
- queueing systems
- transition probabilities
- heuristic solution
- approximation algorithms
- lower bound
- upper bound
- worst case
- markov chain
- random walk
- numerical methods
- arrival rate
- bin packing
- traveling salesman problem
- markov processes
- queueing networks
- single server
- special case