Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Equi-depth multidimensional histograms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Structured partitioning problems
Operations Research
Rectilinear partitioning of irregular data parallel computations
Journal of Parallel and Distributed Computing
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
Partitioning a matrix to minimize the maximum cost
Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Balancing histogram optimality and practicality for query result size estimation
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Improved histograms for selectivity estimation of range predicates
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Histogram-based estimation techniques in database systems
Histogram-based estimation techniques in database systems
Self-tuning histograms: building histograms without looking at data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Approximating multi-dimensional aggregate range queries over real attributes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Approximations for the general block distribution of a matrix
Theoretical Computer Science
Machine Learning
Accurate estimation of the number of tuples satisfying a condition
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Partitioning an Array onto a Mesh of Processors
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
Optimal Histograms with Quality Guarantees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Universality of Serial Histograms
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
On the Complexity of the Generalized Block Distribution
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The optimization of queries in relational databases
The optimization of queries in relational databases
Post-placement voltage island generation under performance requirement
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Post-placement voltage island generation
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Efficient computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Hierarchical synopses with optimal error guarantees
ACM Transactions on Database Systems (TODS)
Multiplicative synopses for relative-error metrics
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Geometric algorithms for optimal airspace design and air traffic controller workload balancing
Journal of Experimental Algorithmics (JEA)
A framework for efficient data anonymization under privacy and accuracy constraints
ACM Transactions on Database Systems (TODS)
A fast and robust bulk-loading algorithm for indexing very large digital elevation datasets
Computers & Geosciences
Relations between two common types of rectangular tilings
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Secure multidimensional range queries over outsourced data
The VLDB Journal — The International Journal on Very Large Data Bases
Load-balancing spatially located computations using rectangular partitions
Journal of Parallel and Distributed Computing
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Post-placement voltage island generation for timing-speculative circuits
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
We study the problem of optimally partitioning a two-dimensional array of elements by cutting each coordinate axis into p (respectively, q) intervals, resulting in p × q rectangular regions. This problem arises in several applications in databases, parallel computation, and image processing. Our main contribution are new approximation algorithms for these NP-complete problems that improve significantly over previously known bounds. The algorithms are fast and simple, work for a variety of measures of partitioning quality, generalize to dimensions d 2, and achieve almost optimal approximation ratios. We also extend previous NP-completeness results for this class of problems.