A fast network flows heuristic for cell suppression in positive tables

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Current network flows heuristics for cell suppression in positive tables (i.e, cell values are greater or equal than zero) rely on the solution of several minimum-cost subproblems. A very efficient heuristic based on shortest-paths was also developed in the past, but it was only appropriate for general tables (i.e., cell values can be either positive or negative), whereas in practice most real tables are positive. The method presented in this work overcomes the lacks of previous approaches: it is designed for positive tables and only requires the solution of shortest-paths subproblems. It follows that it is orders of magnitude faster than previous network flows heuristics. We report an extensive computational experience in the solution of two-dimensional tables, either with or without hierarchical rows, of up to 250000 and 500000 cells, respectively. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Castro, J. (2004). A fast network flows heuristic for cell suppression in positive tables. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3050, 136–148. https://doi.org/10.1007/978-3-540-25955-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free