Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1161.68874OpenAlexW3010016474MaRDI QIDQ5394263FDOQ5394263

Authors: Markus Bläser, L. Shankar Ram, Maxim Sviridenko 

Publication date: 25 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11534273

Recommendations

• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• Improved approximation algorithms for metric MaxTSP
• Algorithms – ESA 2005
• Improved deterministic approximation algorithms for max TSP
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Mathematics Subject Classification ID

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

Cited In (9)

• 35/44-approximation for asymmetric maximum TSP with triangle inequality
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• An improved approximation algorithm for ATSP
• Minimum-Weight Cycle Covers and Their Approximability
• The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
• Approximation algorithms for maximum latency and partial cycle cover
• Minimum-weight cycle covers and their approximability
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Algorithms and Data Structures

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