Abstract
We consider the following tiling problem: Given a d dimensional array A of size n in each dimension, containing non-negative numbers and a positive integer p, partition the array A into at most p disjoint rectangular subarrays called rectangles so as to minimise the maximum weight of any rectangle. The weight of a subarray is the sum of its elements.
In the paper we give a \(\frac{d+2}{2}\)-approximation algorithm that is tight with regard to the only known and used lower bound so far.
This is a preview of subscription content, log in via an institution to check access.
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
Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41(2), 443–470 (2001)
Grigni, M., Manne, F.: On the complexity of generalized block distribution. In: Saad, Y., Yang, T., Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1996. LNCS, vol. 1117, pp. 319–326. Springer, Heidelberg (1996)
Han, Y., Narahari, B., Choi, H.A.: Mapping a chain task to chained processors. Information Processing Letters 44, 141–148 (1992)
Khanna, S., Muthukrishnan, S., Paterson, M.: On approximating rectangle tiling and packing. In: Proc. 19th SODA, pp. 384–393 (1998)
Khanna, S., Muthukrishnan, S., Skiena, S.: Efficient array partitioning. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 616–626. Springer, Heidelberg (1997)
Loryś, K., Paluch, K.: Rectangle Tiling. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 206–213. Springer, Heidelberg (2000)
Loryś, K., Paluch, K.: A new approximation algorithm for RTILE problem. Theor. Comput. Sci. 2-3(303), 517–537 (2003)
Martin, G., Muthukrishnan, S., Packwood, R., Rhee, I.: Fast algorithms for variable size block matching motion estimation with minimal error. IEEE Trans. Circuits Syst. Video Techn. 10(1), 42–50 (2000)
Muthukrishnan, S., Poosala, V., Suel, T.: On rectangular partitioning in two dimensions: algorithms, complexity, and applications. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 236–256. Springer, Heidelberg (1998)
Paluch, K.: A 2(1/8)-Approximation Algorithm for Rectangle Tiling. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1054–1065. Springer, Heidelberg (2004)
Sharp, J.: Tiling Multi-dimensional Arrays. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 500–511. Springer, Heidelberg (1999)
Smith, A., Suri, S.: Rectangular Tiling in Multidimensional Arrays. J. Algorithms 37(2), 451–467 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paluch, K. (2006). A New Approximation Algorithm for Multidimensional Rectangle Tiling. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_71
Download citation
DOI: https://doi.org/10.1007/11940128_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)