scientific article; zbMATH DE number 6297727
From MaRDI portal
Publication:5417644
zbMath1288.68099MaRDI QIDQ5417644
Stefan Szeider, Eun Jung Kim, Noga Alon, Gregory Gutin, Anders Yeo
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (15)
Improved Parameterized Algorithms for above Average Constraint Satisfaction ⋮ Kernelization – Preprocessing with a Guarantee ⋮ Note on maximal bisection above tight lower bound ⋮ Detours in directed graphs ⋮ Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables ⋮ A probabilistic approach to problems parameterized above or below tight bounds ⋮ Betweenness parameterized above tight lower bound ⋮ Lower bounds on kernelization ⋮ Going Far from Degeneracy ⋮ Confronting intractability via parameters ⋮ Note on Max Lin-2 above average ⋮ Unnamed Item ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
