ScholarLens Back to search
2004•arXiv (Cornell University)Open access

Compressed polytopes and statistical disclosure limitation

Seth Sullivant

Open full text 4 citations

Abstract

We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize those graphs whose cut polytopes are compressed and discuss consequences for studying linear programming relaxations in statistical disclosure limitation.

Open-access reader

About this research paper

What this paper is about

We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize those graphs whose cut polytopes are compressed and discuss consequences for studying linear programming relaxations in statistical disclosure limitation.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomorphic to a 0/1-polytope. As an application, we characterize those graphs whose cut polytopes are compressed and discuss consequences for studying linear programming relaxations in statistical disclosure limitation.

Key concepts: Polytope, Facet (psychology), Polytope model, Polyhedral combinatorics, Lattice (music), Combinatorics, Characterization (materials science), Linear programming

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Compressed polytopes and statistical disclosure limitation — Research Paper | ScholarLens