Approximating integer quadratic programs and MAXCUT in subdense graphs

Andreas Björklund

Research output: Contribution to journalArticlepeer-review

Abstract

Let A be a real symmetric n x n-matrix with eigenvalues, lambda(1),..., lambda(n) ordered after decreasing absolute value, and b an n x 1-vector. We present an algorithm finding approximate solutions to min x*(Ax+b) and maxx*(Ax+b) over x is an element of {-1,1}(n), with an absolute error of at most (c(1) vertical bar lambda(1)vertical bar +vertical bar lambda([c2 log n])vertical bar)2n + O(alpha n + beta) root n log n), where alpha and beta are the largest absolute values of the entries in A and b, respectively, for any positive constants c1 and c2, in time polynomial in n. We demonstrate that the algorithm yields a PTAS for MAXCUT in regular graphs on n vertices of degree d of omega(root n log n), as long as they contain O(d(4) log n) 4-cycles. The strongest previous result showed that Omega(n/log n) average degree graphs admit a PTAS.
Original languageEnglish
Pages (from-to)839-849
JournalLecture Notes in Computer Science
Volume3669
Publication statusPublished - 2005

Subject classification (UKÄ)

  • Computer Science

Fingerprint

Dive into the research topics of 'Approximating integer quadratic programs and MAXCUT in subdense graphs'. Together they form a unique fingerprint.

Cite this