Name
Abstract | ||
|---|---|---|
A table with two rows and n columns may be thought of as two vectors with n components. The distance between the two rows then corresponds to the norm of the difference between the rows. We examine the problem of how to collapse the adjacent columns of the table while keeping the norm of the difference as large as possible. First a stepwise algorithm is given which achieves this end with respect to the norm of the vector of differences. After proving the optimality of the stepwise solution we extend the result to the norm which arises from minimizing the number of persons misclassified. The same algorithm suffices. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0166-218X(83)90099-9 | DISCRETE APPLIED MATHEMATICS |
Field | DocType | Volume |
Row,Discrete mathematics,Combinatorics,Algorithm,Real number,Mathematics | Journal | 6 |
Issue | ISSN | Citations |
1 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Kleitman | 1 | 854 | 277.98 |
| Robert A. Lew | 2 | 1 | 1.37 |