An improved randomized approximation algorithm for Max TSP
From MaRDI portal
Publication:2576776
DOI10.1007/s10878-005-1779-7zbMath1093.90046MaRDI QIDQ2576776
Publication date: 14 December 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-1779-7
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
68W25: Approximation algorithms
Related Items
Parameterized and approximation algorithms for finding two disjoint matchings, Approximation algorithms for maximum latency and partial cycle cover, Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems, Improved approximation algorithms for metric MaxTSP, Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
Cites Work