On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours

DOI10.1016/j.jda.2006.03.004zbMath1192.90179OpenAlexW1993464679MaRDI QIDQ924547

Marco Martens, Henk G. Meijer

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.004

zbMATH Keywords

geometric algorithmsapproximation algorithmslongest Hamiltonian cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• The algebraic degree of geometric optimization problems
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• On minimum stars and maximum matchings.
• The geometric maximum traveling salesman problem
• Solving a "Hard" problem to approximate an "Easy" one

This page was built for publication: On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours