Equi-depth multidimensional histograms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Mining optimized association rules for numeric attributes
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
Histogram-based estimation techniques in database systems
Histogram-based estimation techniques in database systems
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Rectangular tiling in multi-dimensional arrays
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Mining Optimized Support Rules for Numeric Attributes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
The optimization of queries in relational databases
The optimization of queries in relational databases
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Slice and dice: a simple, improved approximate tiling recipe
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Binary space partitions for line segments with a limited number of directions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Routing and Admission Control in Networks with Advance Reservations
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Approximation algorithms for MAX-MIN tiling
Journal of Algorithms
Image-Based Collision Detection for Deformable Cloth Models
IEEE Transactions on Visualization and Computer Graphics
Coloring kk-free intersection graphs of geometric objects in the plane
Proceedings of the twenty-fourth annual symposium on Computational geometry
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A partition-based heuristic for translational box covering
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Geometric algorithms for optimal airspace design and air traffic controller workload balancing
Journal of Experimental Algorithmics (JEA)
Approximation algorithms for min-max generalization problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Coloring and maximum independent set of rectangles
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
Constant integrality gap LP formulations of unsplittable flow on a path
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly efficient since their running times are near-linear in the space input size rather than in the domain size. In addition, we improve the best known approximation ratios, in some cases quite significantly.