A combinatorial algorithm for MAX CSP
type: Item
instance of: scholarly article
title: A combinatorial algorithm for MAX CSP
zbMATH Open document ID: 1173.68880
DOI: 10.1016/S0020-0190(02)00435-0
author: Mayur Datar
author: Tomás Feder
author: Aristides Gionis
author: Rina Panigrahy
author: Rajeev Motwani
published in: Information Processing Letters
publication date: 2009-03-23T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5530894
zbMATH Keywords: algorithmical approximation
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: databases
zbMATH Keywords: design of algorithms
zbMATH Keywords: graph algorithms
describes a project that uses: MS SQL Server
MaRDI profile type: Publication
cites work: A new way of using semidefinite programming with applications to linear equations mod \(p\)
cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
cites work: .878-approximation algorithms for MAX CUT and MAX 2SAT
cites work: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
cites work: Combinatorial approximation algorithms for the maximum directed cut problem
cites work: Q4526964
full work available at URL: s0020-0190(02)00435-0
OpenAlex ID: W2084350425
description: scientific article; zbMATH DE number 5530894