Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
From MaRDI portal
Recommendations
Cited in
(47)- Approximation algorithms for maximum latency and partial cycle cover
- Minimum-weight cycle covers and their approximability
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- Approximating the minimum tour cover of a digraph
- Complexity of the directed spanning cactus problem
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles
- Motion planning algorithms for the Dubins Travelling Salesperson Problem
- Commute times for a directed graph using an asymmetric Laplacian
- Improved approximation algorithms for metric MaxTSP
- TSP with bounded metrics
- Approximability of the multiple stack TSP
- Towards better inapproximability bounds for TSP: a challenge of global dependencies
- Deterministic algorithms for multi-criteria TSP
- Restricted common superstring and restricted common supersequence
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- Lower and upper competitive bounds for online directed graph exploration
- Minimum-Weight Cycle Covers and Their Approximability
- Approximating Multi-criteria Max-TSP
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
- A probabilistic PTAS for shortest common superstring
- Exponential approximation schemata for some network design problems
- Multi-criteria TSP: Min and Max combined
- The minimum spanning tree problem with non-terminal set
- Approximating shortest superstring problem using de Bruijn graphs
- A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP
- Algorithms as mechanisms: the price of anarchy of relax and round
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
- A polynomial algorithm with asymptotic ratio 2/3 for the asymmetric maximization version of the m-PSP
- Approximating asymmetric TSP in exponential time
- A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem
- Algorithms and Data Structures
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Polyhedral techniques in combinatorial optimization: matchings and tours
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
- Reoptimization of the shortest common superstring problem
- Approximation guarantees for shortest superstrings: simpler and better
- Deterministic algorithms for multi-criteria max-TSP
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
- LP-based solution methods for the asymmetric TSP
- On the relationship between ATSP and the cycle cover problem
- A semidefinite optimization approach to the target visitation problem
- Approximately fair cost allocation in metric traveling salesman games
- Analysis of set-up time models: a metric perspective
- The on-line asymmetric traveling salesman problem
This page was built for publication: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546300)
