Show simple item record

dc.contributor.authorHajiaghayi, Mohammad Taghi
dc.contributor.authorNishimura, Naomi
dc.contributor.authorRagde, Prabhakar
dc.contributor.authorThilikos Touloupas, Dimitrios
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationHajiaghayi, M., Nishimura, N., Ragde, P., Thilikos, D. "Fast approximation schemes for K_{3,3}-minor-free or K_{5}-minor-free graphs". 2002.
dc.description.abstractAs the class of graphs of bounded treewidth is of limited size, we need to solve NP-hard problems for wider classes of graphs than this class. Eppstein introduced a new concept which can be considered as a generalization of bounded treewidth. A graph G has {em locally bounded treewidth} if for each vertex v of G, the treewidth of the subgraph of G induced on all vertices of distance at most r from v is only a function of r, called local treewidth. So far the only graphs determined to have small local treewidth are planar graphs. In this paper, we prove that any graph excluding one of K_{5} or K_{3,3} as a minor has local treewidth bounded by 3k+4. As a result, we can design practical polynomial-time approximation schemes for both minimization and maximization problems on these classes of non-planar graphs.
dc.format.extent20 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherGraphs of bounded treewidth
dc.subject.otherPolynomial-time approximation
dc.subject.otherNon-planar graphs
dc.titleFast approximation schemes for K_{3,3}-minor-free or K_{5}-minor-free graphs
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorHajiaghayi, M.; Nishimura, N.; Ragde, P.; Thilikos, D.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder