Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing

DOI10.1007/978-3-642-14031-0_9zbMath1286.68507OpenAlexW1767330425MaRDI QIDQ3578303

Anke van Zuylen

Publication date: 20 July 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_9

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) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Improved Approximation Algorithms for Weighted 2-Path Partitions ⋮ Improved approximation algorithms for weighted 2-path partitions ⋮ A local search algorithm for binary maximum 2-path partitioning

This page was built for publication: Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing