The complexity of three-way statistical tables

SIAM Journal on Computing

Volumn 33, Issue 4, 2004, Pages 819-836

  De Loera, Jesus ^a   Onn, Shmuel ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Computational complexity; Confidentiality; Contingency table; Data quality; Data security; Fr chet bound; Marginal statistics; Statistical disclosure control; Statistical table; Transportation polytope; Transportation problems

Indexed keywords

CONFIDENTIALITY; CONTINGENCY TABLE; DATA QUALITY; FRECHET BOUND; STATISTICAL DISCLOSURE CONTROL; STATISTICAL TABLE; TRANSPORTATION POLYTOPE; TRANSPORTATION PROBLEMS;

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SECURITY OF DATA; SET THEORY; STATISTICAL PROCESS CONTROL; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 4544288856     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702403803     Document Type: Article

References (29)

1. N. ALON AND S. ONN, Separable partitions, Discrete Appl. Math., 91 (1999), pp. 39-51.
2. American FactFinder, U.S. Bureau of the Census, http://factfinder.census. gov/servlet/ BasicFactsServlet.
3. S. AVIRAN AND S. ONN, Momentopes, the complexity of vector partitioning, and Davenport Schinzel sequences, Discrete Comput. Geom., 27 (2002), pp. 409-417.
4. A. I. BARVINOK, A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed, Math. Oper. Res., 19 (1994), pp. 769-779.
5. L. H. Cox, Some remarks on research directions in statistical data protection, in Statistical Data Protection, Proceedings of Eurostat, Luxembourg, 1999, pp. 163-176.
6. L. H. Cox, On Properties of Multi-dimensional Statistical Tables, manuscript, U.S. Environmental Protection Agency, 2000.
7. L. H. Cox, Bounding entries in 3-dimensional contingency tables, in Inference Control in Statistical Databases: From Theory to Practice, Lecture Notes in Comput. Sci. 2316, Springer-Verlag, Heidelberg, 2002, pp. 21-33.
8. J. DE LOERA AND B. STURMFELS, Algebraic unimodular counting, Math. Program., 96 (2003), pp. 183-203.
9. P. DIACONIS AND B. EFRON, Testing for independence in a two-way table: New interpretations of the chi-square statistics, Ann. Statist., 13 (1985), pp. 845-874.
10. P. DIACONIS AND A. GANGOLLI, Rectangular arrays with fixed margins, in Discrete Probability and Algorithms (Minneapolis, MN, 1993), IMA Vol. Math. Appl. 72, Springer-Verlag, New York, 1995, pp. 15-41.
11. A. DOBRA AND S. E. FIENBERG, Bounds for cell entries in contingency tables given marginal totals and decomposable graphs, Proc. Natl. Acad. Sci. USA, 97 (2000), pp. 11885-11892.
12. G. T. DUNCAN, S. E. FIENBERG, R. KRISHNAN, R. PADMAN, AND S. F. ROEHRIG, Disclosure limitation methods and information loss for tabular data, in Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, P. Doyle, J. I. Land, J. M. Theeuwes, and L. V. Zayatz, eds., North-Holland, Amsterdam, 2001, pp. 135-166.
13. M. E. DYER, R. KANNAN, AND J. MOUNT, Sampling contingency tables, Random Structures Algorithms, 10 (1997), pp. 487-506.
14. S. E. FIENBERG, Fréchet and Bonferroni bounds for multi-way tables of counts with applications to disclosure limitation, in Statistical Data Protection, Proceedings of Eurostat, Lisbon, 1998, pp. 117-129.
15. M. GAREY AND D. S. JOHNSON, Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
16. D. GUSFIELD, A graph theoretic approach to statistical data security, SIAM J. Comput., 17 (1988), pp. 552-571.
17. D. GUSFIELD, Faster Detection of Compromised Data in 2-D Tables, Technical Report CSE-89-30, Computer Science Department, University of California at Davis, 1989.
18. S. HOŞTEN AND S. SULLIVANT, Gröbner bases and polyhedral geometry of reducible and cyclic models, J. Combin. Theory Ser. A, 100 (2002), pp. 277-301.
19. F. K. HWANG, S. ONN, AND U. G. ROTHBLUM, A polynomial time algorithm for shaped partition problems, SIAM J. Optim., 10 (1999), pp. 70-81.
20. R. W. IRVING AND M. R. JERRUM, Three-dimensional statistical data security problems, SIAM J. Comput., 23 (1994), pp. 170-184.
21. H. W. LENSTRA, Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983), pp. 538-548.
22. C. R. MEHTA AND N. R. PATEL, A network algorithm for performing Fisher's exact test in r × c contingency tables, J. Amer. Statist. Assoc., 78 (1983), pp. 427-434.
23. S. ONN AND U. G. ROTHBLUM, Convex combinatorial optimization, Discrete Comput. Geom., to appear.
24. S. ONN AND L. J. SCHULMAN, The vector partition problem for convex objective functions, Math. Oper. Res., 26 (2001), pp. 583-590.
25. S. F. ROEHRIG, Disclosure in multi-way tables with cell suppression: Simplex and shuttle solution, in Proceedings of the Joint Statistical Meetings, American Statistical Association, Alexandria, VA, 1999.
26. S. F. ROEHRIG, The Integer Rounding Property and Bounds on Contingency Tables, working paper, The Heinz School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA, 2001.
27. L. G. VALIANT, The complexity of computing the permanent, Theoret. Comput. Sci., 8 (1979), pp. 189-201.
28. M. VLACH, Conditions for the existence of solutions of the three-dimensional planar transportation problem, Discrete Appl. Math., 13 (1986), pp. 61-78.
29. V. A. YEMELICHEV, M. M. KOVALEV, AND M. K. KRAVTSOV, Polytopes, Graphs, and Optimisation, Cambridge University Press, Cambridge, UK, 1984.