scientific article
From MaRDI portal
Publication:2754129
zbMath0973.68079MaRDI QIDQ2754129
Jonas Holmerin, Lars Engebretsen
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
The consensus string problem and the complexity of comparing hidden Markov models. ⋮ Towards optimal lower bounds for clique and chromatic number. ⋮ On the approximability of clique and related maximization problems ⋮ Fast Heuristics and Approximation Algorithms ⋮ The Bipartite QUBO ⋮ The clique problem in ray intersection graphs ⋮ A 3/4 differential approximation algorithm for traveling salesman problem ⋮ From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More ⋮ Inapproximability results for equations over infinite groups ⋮ Hyperbolic set covering problems with competing ground-set elements ⋮ Approximating the maximum clique minor and some subgraph homeomorphism problems
This page was built for publication:
