Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems

DOI10.1016/j.dam.2013.03.001zbMath1293.90064OpenAlexW2034061663MaRDI QIDQ2446858

Anke van Zuylen

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.001

zbMATH Keywords

approximation algorithmsderandomizationmaximum triangle packingmaximum traveling salesman problempessimistic estimators

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Feedback arc set problem in bipartite tournaments ⋮ A randomized approximation algorithm for metric triangle packing ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards

Cites Work

• Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing
• Erratum to ``An approximation algorithm for maximum triangle packing
• An improved randomized approximation algorithm for maximum triangle packing
• Deterministic 7/8-approximation for the metric maximum TSP
• Improved deterministic approximation algorithms for max TSP
• Matching theory
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Better approximations for max TSP
• An approximation algorithm for maximum triangle packing
• An improved randomized approximation algorithm for Max TSP
• A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems