Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem

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

Volumn 1879, Issue , 2000, Pages 211-219

  Gaur, Daya Ram ^a   Ibaraki, Toshihide ^b   Krishnamurti, Ramesh ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Approximation algorithms; Combinatorial optimization; Rectangle stabbing; Rectilinear partitioning

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GEOMETRY; ALGORITHMS; OPTIMIZATION;

APPROXIMATION RATIOS; CONSTANT RATIO; MAXIMUM LOAD; NONNEGATIVE INTEGERS; NP-HARD; RECTANGLE STABBING; RECTILINEAR PARTITIONING; TWO DIMENSIONAL SPACES;

APPROXIMATION ALGORITHMS;

EID: 84927160455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_20     Document Type: Article

References (14)

1. M. J. Berger and S. H. Bokhari. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Transactions on Computers, C-36(5):570–580, May 1987.
2. S. H. Bokhari. Partitioning problems in parallel, pipelined, and distributed computing. IEEE Transactions on Computers, C-37(1):48–57, January 1988.
3. H. A. Choi and B. Narahari. Algorithms for mapping and partitioning chain structured parallal computations. In Proceedings of the International Conference on Parallel Processing, volume 1, pages 625–628, August 1991.
4. V. Chvatal. A greedy heuristic for the set covering problem. Math. of Operations Research, 4:233–235, 1979.
5. G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors: General Techniques and Regular Problems. Prentice Hall, Englewood Cliffs, New Jersey, 07632, 1988.
6. M. Grigni and F Manne. On the complexity of the generalized block distribution. In Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems, Lecture Notes in Computer Science, pages 319–326. Springer-Verlag, 1996.
7. R. Hassin and N. Megiddo. Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics, 30:29–42, 1991.
8. D. S. Hochbaum. Approximation algorithms for the set covering and vertex cover problem. SIAM Journal on Computing, 11:555–556, 1982.
9. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Science, 9:256–278, 1974.
10. S. Khanna, S. Muthukrishnan, and S. Skiena. Efficient array partitioning. In Proceedings of the 24th. International Colloquim on Automata, Languages and Programming, Lecture Notes in Computer Science, pages 616–626. Springer-Verlag, 1997.
11. F. Manne and T. Sorevik. Structured partitioning of arrays. Technical Report CS-96-119, Dept. of Informatics, Univ. of Bergen, Norway, 1995.
12. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience, 1988.
13. D. M. Nicol. Rectilinear partitioning of irregular data parallel computations. Journal of Parallel and Distributed Computing, 23:119–134, 1994.
14. D. M. Nicol and D. R. O’Hallaron. Improved algorithms for mappimg parallel and pipelined computations. IEEE Transactions on Computers, 40(3):295–306, 1991.