Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1161.68874OpenAlexW3010016474MaRDI QIDQ5394263FDOQ5394263

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

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

Mathematics Subject Classification ID

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

Cited In (6)

• 35/44-approximation for asymmetric maximum TSP with triangle inequality
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• An improved approximation algorithm for ATSP
• Minimum-Weight Cycle Covers and Their Approximability
• Minimum-weight cycle covers and their approximability
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

   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 👍 👎

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)