Fixed-parameter Approximability of Boolean MinCSPs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1397.68090
author: Édouard Bonnet
author: László Egri
author: Dániel Marx
publication date: 2018-03-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1601.04935
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6846389
zbMATH Keywords: constraint satisfaction problems
zbMATH Keywords: approximability
zbMATH Keywords: fixed-parameter tractability
MaRDI profile type: MaRDI publication profile
arXiv ID: 1601.04935
OpenAlex ID: W2962826665
title: Fixed-parameter Approximability of Boolean MinCSPs
DOI: 10.4230/LIPICS.ESA.2016.18
Recommended article: On approximability of Boolean formula minimization
Recommended article: On approximation algorithms for the minimum satisfiability problem
Recommended article: Towards a Characterization of Constant-Factor Approximable Min CSPs
Recommended article: Q4947153
Recommended article: Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
Recommended article: Q3335526
Recommended article: The Parameterized Complexity of Maximality and Minimality Problems
Recommended article: The parameterized complexity of maximality and minimality problems
Recommended article: The complexity of Boolean formula minimization
description: scientific article; zbMATH DE number 6846389