Compressed polytopes and statistical disclosure limitation
组合数学
2007-06-13 v1 最优化与控制
统计理论
统计理论
摘要
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.
引用
@article{arxiv.math/0412535,
title = {Compressed polytopes and statistical disclosure limitation},
author = {Seth Sullivant},
journal= {arXiv preprint arXiv:math/0412535},
year = {2007}
}
备注
14 pages