Tohoku Mathematical Journal
2006
September
SECOND SERIES VOL. 58, NO. 3

Tohoku Math. J.
58 (2006), 433-445

Title COMPRESSED POLYTOPES AND STATISTICAL DISCLOSURE LIMITATION

Author Seth Sullivant

(Received January 5, 2005, revised December 14, 2005)
Abstract. We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and prove 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.

2000 Mathematics Subject Classification. Primary 52B20; Secondary 90C10, 62H17.
Key words and phrases. Compressed polytope, disclosure limitation, algebraic statistics, integer programming, cut polytope.

To the top of this page

Back to the Contents