On the relationship between ATSP and the cycle cover problem

DOI10.1016/J.TCS.2006.10.026zbMATH Open1113.90161OpenAlexW2019570365MaRDI QIDQ868952FDOQ868952

Authors: L. Sunil Chandran, L. Shankar Ram 

Publication date: 26 February 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.026

Recommendations

• scientific article; zbMATH DE number 2086388
• An improved approximation algorithm for the ATSP with parameterized triangle inequality
• Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
• scientific article; zbMATH DE number 2038707
• An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality

zbMATH Keywords

combinatorial optimizationassignment problemapproximation algorithmstraveling salesman problemcycle cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• Performance guarantees for the TSP with a parameterized triangle inequality
• Approximation algorithms for the TSP with sharpened triangle inequality
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
• Title not available (Why is that?)
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
• Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
• On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
• Title not available (Why is that?)
• Title not available (Why is that?)
• On patching algorithms for random asymmetric travelling salesman problems
• Title not available (Why is that?)
• The probabilistic relationship between the assignment and asymmetric traveling salesman problems.
• When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?
• STACS 2004

Cited In (13)

• An overview of graph covering and partitioning
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• Title not available (Why is that?)
• An improved approximation algorithm for the maximum TSP
• Minimum-Weight Cycle Covers and Their Approximability
• Approximation algorithms for multi-criteria traveling salesman problems
• Deterministic algorithms for multi-criteria TSP
• Minimum-weight cycle covers and their approximability
• Approximability of the minimum-weight \(k\)-size cycle cover problem
• Greedy cycles in the star graphs
• Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions
• Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs

This page was built for publication: On the relationship between ATSP and the cycle cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868952)