Approximation algorithms via contraction decomposition
From MaRDI portal
Publication:1945289
DOI10.1007/s00493-010-2341-5zbMath1274.05445MaRDI QIDQ1945289
Bojan Mohar, Erik D. Demaine, Mohammad Taghi Hajiaghayi
Publication date: 5 April 2013
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/63808
graphs of bounded treewidth; contracting edges; graphs of bounded (Euler) genus; obtaining PTASs for contraction-closed problems
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C83: Graph minors