scientific article; zbMATH DE number 6295886

MaRDI QIDQ5417099zbMATH OpenFDO

Authors Pierre Pansu

Publication date 15 May 2014

zbMATH Keywords

approximation algorithmMax Cut

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Semidefinite programming (90C22)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417099)