35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
From MaRDI portal
Publication:3603560
DOI10.1007/978-3-540-73951-7_51zbMath1209.68646OpenAlexW1829077348MaRDI QIDQ3603560
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_51
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Deterministic 7/8-Approximation for the Metric Maximum TSP, Analysis of set-up time models: a metric perspective, Approximation algorithms for maximum latency and partial cycle cover, Deterministic 7/8-approximation for the metric maximum TSP