New approximation algorithm for RTILE problem

Theoretical Computer Science

Volumn 303, Issue 2-3, 2003, Pages 517-537

  Lorys, Krzysztof ^a   Paluch, Katarzyna E ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Approximation algorithms; Rectangle tiling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING;

DATA SETS;

COMPUTER SCIENCE;

EID: 0038480091     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00504-2     Document Type: Conference Paper

References (9)

1. M. Charikar, C. Chekuri, R. Motwani, unpublished.
2. M. Grigni, F. Manne, On the complexity of generalized block distribution, in: Proc. 3rd Internat. Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR'96), Lecture Notes in Computer Science, vol. 1117, Springer, Berlin, pp. 319-326.
3. Han Y., Narahari B., Choi H.-A. Mapping a chain task to chained processors. Inform. Process. Lett. 44:1992;141-148.
4. Khanna S., Muthukrishnan S., Paterson M. On approximating rectangle tiling and packing. Proc. 19th SODA. 1998;384-393.
5. Khanna S., Muthukrishnan S., Skiena S. Efficient array partitioning. Proc. 24th ICALP. 1997;616-626.
6. K. Lorys, K. Paluch, Rectangle tiling, in: Proc. 3rd APPROX, Lecture Notes in Computer Science, vol. 1923, Springer, Berlin, pp. 206-213.
7. G. Martin, S. Muthukrishnan, R. Packwood, I. Rhee, Fast algorithms for variable size block matching motion estimation with minimal error.
8. Muthukrishnan S., Poosala V., Suel T. On rectangular partitioning in two dimensions. algorithms, complexity, and applications Proc. 7th ICDT. 1999;236-256.
9. J. Sharp, Tiling multi-dimensional arrays, in: Proc. 12th FCT, Lecture Notes in Computer Science, vol. 1684, Springer, Berlin, pp. 500-511.