A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximating the cut-norm via Grothendieck's inequality

2004
*
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04
*

The cut-norm ||A|| C of a real matrix A = (a ij ) i∈R,j∈S is the maximum, over all I ⊂ R, J ⊂ S of the quantity | i∈I,j∈J a ij |. This concept plays a major role in the design of efficient approximation algorithms for dense graph and matrix problems. Here we show that the problem of approximating the cut-norm of a given real matrix is MAX SNP hard, and provide an efficient approximation algorithm. This algorithm finds, for a given matrix A = (a ij ) i∈R,j∈S , two subsets I ⊂ R and J ⊂ S, such

doi:10.1145/1007352.1007371
dblp:conf/stoc/AlonN04
fatcat:ndhbtsbzangl3dri366xthopti