New approximation algorithm for RTILE problem

Authors:
Krzysztof Lorys;Katarzyna E. Paluch
Affiliations:
Institute of Computer Science, Wroclaw University, Wroclaw, Poland;Institute of Computer Science, Wroclaw University, Wroclaw, Poland
Venue:
Theoretical Computer Science - Special issue: Tilings of the plane
Year:
2003

Citing 4
Cited 2

Mapping a chain task to chained processors

Information Processing Letters
On approximating rectangle tiling and packing

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of the Generalized Block Distribution

IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Efficient Array Partitioning

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Relations between two common types of rectangular tilings

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A new approximation algorithm for multidimensional rectangle tiling

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a given two-dimensional array of nonnegative numbers and a positive integer p we want to find a covering of the array with p tiles so as to minimize the weight of the heaviest tile. We present a 9/4-approximation linear-time algorithm for this problem, which improves on the previous best result.