Entry uniqueness in margined tables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4302, Issue , 2006, Pages 94-101

  Onn, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

POLYNOMIAL-TIME ALGORITHMS; SAMPLE POINT;

INTEGER PROGRAMMING;

EID: 77950917077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11930242_9     Document Type: Conference Paper

References (12)

1. Aoki, S., Takemura, A.: Minimal basis for connected Markov chain over 3 ×3×K contingency tables with fixed two-dimensional marginals. Austr. New Zeal. J. Stat. 45 (2003) 229-249
2. Cox L.H.: Bounds on entries in 3-dimensional contingency tables. Inference Control in Statistical Databases - From Theory to Practice. Lec. Not. Comp. Sci., Springer, New York, 2316 (2002) 21-33
3. Cox L.H.: On properties of multi-dimensional statistical tables. J. Stat. Plan. Infer. 117 (2003) 251-273
4. De Loera, J., Onn, S.: The complexity of three-way statistical tables. SIAM J. Comp. 33 (2004) 819-836
5. De Loera, J., Onn, S.: All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables. Proc. 10th Ann. Math. Prog. Soc. Symp. Integ. Prog. Combin. Optim., (Columbia University, New York), Lec. Not. Comp. Sci., Springer, New York, 3064 (2004) 338-351
6. De Loera, J., Onn, S.: Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comp. 41 (2006) 173-181
7. De Loera, J., Onn, S.: All linear and integer programs are slim 3-way transportation programs. SIAM J. Optim. (to appear)
8. De Loera, J., Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming (submitted)
9. Duncan, G.T, Fienberg, S.E., Krishnan, R., Padman, R., Roehrig, S.F.: Disclosure limitation methods and information loss for tabular data. In: Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, North-Holland (2001)
10. Irving, R., Jerrum, M.R.: Three-dimensional statistical data security problems. SIAM J. Comp. 23 (1994) 170-184
11. Vlach, M.: Conditions for the existence of solutions of the three-dimensional planar transportation problem. Disc. App. Math. 13 (1986) 61-78
12. Yemelichev, V.A., Kovalev, M.M., Kravtsov, M.K.: Polytopes, Graphs and Optimisation. Cambridge University Press, Cambridge (1984)