Compressed polytopes and statistical disclosure limitation

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 東北大学の論文

著者

• Sullivant Seth

  Department Of Mathematics Harvard University

関連論文

• Compressed polytopes and statistical disclosure limitation

スポンサーリンク