To access the full text documents, please follow this link: http://hdl.handle.net/2117/97497
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor.author | Demaine, Erik D. |
dc.contributor.author | Hajiaghayi, Mohammad Taghi |
dc.contributor.author | Thilikos Touloupas, Dimitrios |
dc.date | 2002-05 |
dc.identifier.citation | Demaine, E., Hajiaghayi, M., Thilikos, D. "1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor". 2002. |
dc.identifier.uri | http://hdl.handle.net/2117/97497 |
dc.description.abstract | We give polynomial-time constant-factor approximation algorithms for the treewidth and branchwidth of any H-minor-free graph for a given graph H with crossing number at most 1. The approximation factors are 1.5 for treewidth and 2.25 for branchwidth. In particular, our result directly applies to classes of nonplanar graphs such as K_{5}-minor-free graphs and K_{3,3}-minor-free graphs. Along the way, we present a polynomial-time algorithm to decompose H-minor-free graphs into planar graphs and graphs of treewidth at most c_H (a constant dependent on H) using clique sums. This result has several applications in designing fully polynomial-time approximation schemes and fixed-parameter algorithms for many NP-complete problems on these graphs. |
dc.language.iso | eng |
dc.relation | LSI-02-40-R |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject | Treewidth of graphs |
dc.subject | Polynomial-time constant-factor approximation algorithms |
dc.title | 1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/report |