Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 222

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Approximating the Cut-Norm via Grothendieck's Inequality

Alon, Noga, Naor, Assaf · 2006 · SIAM Journal on Computing

Abstract

The cut-norm $||A||_C$ of a real matrix $A=(a_{ij})_{i\in R,j\in S}$ is the maximum, over all $I \subset R$, $J \subset S$, of the quantity $|\sum_{i \in I, j\in 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 we provide an efficient approximation algorithm. This algorithm finds, for a given matrix $A=(a_{ij})_{i\in R,j\in S}$, two subsets $I \subset R$ and $J \subset S$, such that $|\sum_{i \in I, j\in J} a_{ij}| \geq \rho ||A||_C$, where $\rho>0$ is an absolute constant satisfying $\rho >0.56$. The algorithm combines semidefinite programming with a rounding technique based on Grothendieck's inequality. We present three known proofs of Grothendieck's inequality, with the necessary modifications which emphasize their algorithmic aspects. These proofs contain rounding techniques which go beyond the random hyperplane rounding of Goemans and Williamson [J. ACM, 42 (1995), pp. 1115-1145], allowing us to transfer various algorithms for dense graph and matrix problems to the sparse case.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0097539704441629

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 222

Metadata

Authors
Alon, N., & Naor, A.
Venue
SIAM Journal on Computing
Published
2006-01
Volume
35
Issue
4
Pages
787-803
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W3023108254
Cited by
222
References
2
FWCI
14.01
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Approximating the Cut-Norm via Grothendieck's Inequality. https://app.cochat.ai/papers/10.1137/s0097539704441629
The paper
Alon, N., & Naor, A. (2006). Approximating the Cut-Norm via Grothendieck's Inequality. SIAM Journal on Computing. https://doi.org/10.1137/s0097539704441629

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.