Name
Abstract | ||
|---|---|---|
We construct examples of contingency tables on n binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide evidence that linear programming may not be an effective heuristic for detecting disclosures when releasing margins of multiway tables. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1137/S0895480104444090 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
n binary random variable,effective heuristic,large gaps,linear programming,multiway table,contingency table,cell entry,upper bound,small contingency tables,true integer,linear program,integer programming,grobner basis,random variable | Integer,Discrete mathematics,Heuristic,Combinatorics,Random variable,Upper and lower bounds,Integer programming,Contingency table,Linear programming,Mathematics,Marginal distribution | Journal |
Volume | Issue | ISSN |
18 | 4 | 0895-4801 |
Citations | PageRank | References |
2 | 0.42 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seth Sullivant | 1 | 93 | 19.17 |