Abstract
We consider two tiling problems for two-dimensional arrays: given an nxn array A of nonnegative numbers we are to construct an optimal partition of it into rectangular subarrays. The subarrays cannot overlap and they have to cover all array elements. The first problem (RTILE) consists in finding a partition using p subarrays that minimizes the maximum weight of subarrays (by weight we mean the sum of all elements covered by the subarray). The second, dual problem (DRTILE), is to construct a partition into minimal number of subarrays such that the weight of each subarray is bounded by a given value W. We show a linear-time 7/3-approximation algorithm for the RTILE problem. This improves the best previous result both in time and in approximation ratio. If the array A is binary (i.e. contains only zeroes and ones) we can reduce the approximation ratio up to 2. For the DRTILE problem we get an algorithm which achieves a ratio 4 and works in linear-time. The previously known algorithm with the same ratio worked in time O(n 5). For binary arrays we present a linear-time 2-approximation algorithm.
Partially supported by Komitet BadaĆ Naukowych, grants 8 T11C 032 15 and 8 T11C 044 19.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Grigni, F. Manne, On the complexity of generalized block distribution, Proc. 3rd intern. workshop on parallel algorithms for irregularly structured problems (IRREGULARâ96), Springer, 1996, LNCS 1117, 319â326.
Y. Han, B. Narahari, H.-A. Choi, Mapping a chain task to chained processors, Information Processing Letters 44, 141â148, 1992.
S. Khanna, S. Muthukrishnan, M. Paterson, On approximating rectangle tiling and packing, Proc. 19th SODA (1998), 384â393.
S. Khanna, S. Muthukrishnan, S. Skiena, Efficient array partitioning, Proc. 24th ICALP, 616â626, 1997.
G. Martin, S. Muthukrishnan, R. Packwood, I. Rhee,Fast algorithms for variable size block matching motion estimation with minimal error.
S. Muthukrishnan, V. Poosala, T. Suel, On rectangular partitionings in two dimensions: algorithms, complexity, and applications, Proc. ICDTâ99, LNCS 1540, 236â256.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
LoryĆ, K., Paluch, K. (2000). Rectangle Tiling. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-44436-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67996-7
Online ISBN: 978-3-540-44436-7
eBook Packages: Springer Book Archive