A 2-approximation for the maximum satisfying bisection problem
type: Item
instance of: scholarly article
title: A 2-approximation for the maximum satisfying bisection problem
zbMATH Open document ID: 1220.90153
author: Rico Zenklusen
author: Bernard Ries
published in: European Journal of Operational Research
publication date: 2011-04-29T00:00:00Z
full work available at URL: satiscopy.pdf
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5882493
zbMATH Keywords: approximation algorithm
zbMATH Keywords: vertex partition
zbMATH Keywords: complexity theory
MaRDI profile type: Publication
OpenAlex ID: W2059601777
cites work: The satisfactory partition problem
cites work: Approximation of satisfactory bisection problems
cites work: Satisfactory graph partition, variants, and generalizations
cites work: Algorithmic approach to the satisfactory graph partitioning problem
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q4258215
DOI: 10.1016/J.EJOR.2010.11.010
description: scientific article; zbMATH DE number 5882493