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: CoRR (2022)
Keyphrases
- approximation schemes
- travelling salesman
- queueing systems
- transition probabilities
- heuristic solution
- approximation algorithms
- lower bound
- worst case
- upper bound
- markov chain
- traveling salesman problem
- arrival rate
- markov processes
- special case
- bin packing
- hidden markov models
- branch and bound algorithm
- optimal solution
- control problems