On the complexity of approximating the Hadwiger number
type: Item
instance of: scholarly article
title: On the complexity of approximating the Hadwiger number
zbMATH Open document ID: 1162.68018
published in: Theoretical Computer Science
publication date: 2009-03-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 5529529
zbMATH Keywords: approximation
zbMATH Keywords: Hadwiger number
zbMATH Keywords: graph minors
author: Martin Wahlen
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.020
OpenAlex ID: W1989192933
cites work: Approximating the maximum clique minor and some subgraph homeomorphism problems
DOI: 10.1016/J.TCS.2008.12.020
Recommended article: Q4212463
Recommended article: Complexity of approximation problems
Recommended article: Q2753731
Recommended article: On the Approximation Complexity Hierarchy
Recommended article: The relative complexity of approximate counting problems
Recommended article: Q4638059
Recommended article: On the parameterized complexity of approximate counting
Recommended article: Computation of Hadwiger Number and Related Contraction Problems
Recommended article: Q3424894
Recommended article: The complexity of polynomial-time approximation
description: scientific article; zbMATH DE number 5529529