Rectangle tiling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1913, Issue , 2000, Pages 206-213

  Loryś, Krzysztof ^a   Paluch, Katarzyna ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION;

APPROXIMATION RATIOS; ARRAY ELEMENTS; BINARY ARRAYS; DUAL PROBLEM; LINEAR TIME; NON NEGATIVES; OPTIMAL PARTITIONS; TWO-DIMENSIONAL ARRAYS;

APPROXIMATION ALGORITHMS;

EID: 84937438796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44436-x_21     Document Type: Conference Paper

References (7)

1. M. Charikar, C. Chekuri, R Motwani, Unpublished, 1996.
2. 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.
3. Y. Han, B. Narahari, H.-A. Choi, Mapping a chain task to chained processors, Information Processing Letters 44, 141-148, 1992.
4. S. Khanna, S. Muthukrishnan, M. Paterson, On approximating rectangle tiling and packing, Proc. 19th SODA (1998), 384–393.
5. S. Khanna, S. Muthukrishnan, S. Skiena, Efficient array partitioning, Proc. 24th ICALP, 616-626, 1997.
6. G. Martin, S. Muthukrishnan, R. Packwood, I. Rhee, Fast algorithms for variable size block matching motion estimation with minimal error.
7. S. Muthukrishnan, V. Poosala, T. Suel, On rectangular partitionings in two dimensions: algorithms, complexity, and applications, Proc. ICDT’99, LNCS 1540, 236-256.