scientific article

DOI10.4230/LIPIcs.STACS.2012.501zbMath1245.68252MaRDI QIDQ2904788

Anke van Zuylen, Katarzyna E. Paluch, Khaled M. Elbassioni

Publication date: 23 August 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmmaximum asymmetric traveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (8)

An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem ⋮ A probabilistic PTAS for shortest common superstring ⋮ On the Shortest Common Superstring of NGS Reads ⋮ New Approximation Algorithms for (1,2)-TSP ⋮ Maximum ATSP with weights zero and one via half-edges ⋮ Approximating Shortest Superstring Problem Using de Bruijn Graphs ⋮ A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round

This page was built for publication: