Approximation algorithms for maximum cut with limited unbalance
type: Item
instance of: scholarly article
title: Approximation algorithms for maximum cut with limited unbalance
zbMATH Open document ID: 1124.68117
author: Giulia Galbiati
author: Francesco Maffioli
published in: Theoretical Computer Science
publication date: 2007-10-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5201835
zbMATH Keywords: randomized approximation algorithm
zbMATH Keywords: semidefinite programming
zbMATH Keywords: maximum cut
zbMATH Keywords: limited unbalance cut
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.05.036
OpenAlex ID: W1980036307
cites work: Q4263699
cites work: Balancing signed graphs
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: Q4230322
cites work: Approximation algorithms for maximization problems arising in graph partitioning
cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
cites work: Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Algorithms – ESA 2005
cites work: Q4840774
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: A .699-approximation algorithm for Max-Bisection.
DOI: 10.1016/J.TCS.2007.05.036
description: scientific article