Improved approximation algorithms for maximum graph partitioning problems
type: Item
instance of: scholarly article
title: Improved approximation algorithms for maximum graph partitioning problems
zbMATH Open document ID: 1093.90069
author: Gerold Jäger
author: Anand Srivastav
published in: Journal of Combinatorial Optimization
publication date: 2006-02-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5005138
zbMATH Keywords: maximum graph partitioning
zbMATH Keywords: approximation factor
zbMATH Keywords: semidefinite programming
MaRDI profile type: Publication
full work available at URL: s10878-005-2269-7
OpenAlex ID: W1514508085
cites work: A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
cites work: Q4263699
cites work: Greedily Finding a Dense Subgraph
cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
cites work: Approximation algorithms for maximization problems arising in graph partitioning
cites work: Q4535020
cites work: The dense \(k\)-subgraph problem
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
cites work: An improved rounding method and semidefinite programming relaxation for graph partition
cites work: Q4400856
cites work: A .699-approximation algorithm for Max-Bisection.
cites work: Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
DOI: 10.1007/S10878-005-2269-7
description: scientific article; zbMATH DE number 5005138