A Pseudo-approximation for the Genus of Hamiltonian Graphs

DOI10.1007/978-3-642-40328-6_18zbMath1405.68447MaRDI QIDQ2851861

Yury Makarychev, Anastasios Sidiropoulos, Amir Nayyeri

Publication date: 4 October 2013

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_18

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C45: Eulerian and Hamiltonian graphs

Related Items

Approximation Algorithms for Euler Genus and Related Problems, Stronger ILPs for the Graph Genus Problem.