scientific article; zbMATH DE number 1306896
From MaRDI portal
Publication:4252749
Cited in
(15)- A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
- Constant factor approximation for ATSP with two edge weights
- An improved upper bound for the universal TSP on the grid
- An LP-based approximation algorithm for the generalized traveling salesman path problem
- TSP on cubic and subcubic graphs
- The traveling salesman problem on cubic and subcubic graphs
- Time complexity of the analyst's traveling salesman algorithm
- Competitive on-line coverage of grid environments by a mobile robot
- An improved strategy for exploring a grid polygon
- The complexity of the Hajós calculus for planar graphs
- \(\frac{13}{9}\)-approximation for graphic TSP
- Approximation algorithms for lawn mowing and milling
- Constant factor approximation for ATSP with two edge weights (extended abstract)
- Approximation algorithms via contraction decomposition
- Travelling on graphs with small highway dimension
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252749)
