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

Journal of Algorithms

Volumn 43, Issue 1, 2002, Pages 138-152

  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

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY; TWO DIMENSIONAL;

CONSTANT RATIO APPROXIMATION ALGORITHMS; RECTANGLE STABBING PROBLEM; RECTILINEAR PARTITIONING PROBLEM;

APPROXIMATION THEORY;

EID: 0036557482     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2002.1221     Document Type: Article

References (18)

1. B. Aspvall, M. M. Halldórsson, and F. Manne, Approximations for the general block distribution of a matrix, in "Proceedings of the Fifth Scandinavian Workshop on Algorithm Theory," Lecture Notes in Computer Science, Vol. 1432, pp. 47-58, Springer-Verlag, Berlin/New York, 1998.
2. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in "Proceedings of the 25th ACM Symposium on Theory of Computation," pp. 294-304, 1993.
3. M. J. Berger and S. H. Bokhari, A partitioning strategy for nonuniform problems on multiprocessors, IEEE Trans. Comput. C-36, No. 5 (1987), 570-580.
4. S. H. Bokhari, Partitioning problems in parallel, pipelined, and distributed computing, IEEE Trans. Comput. C-37, No. 1 (1988), 48-57.
5. H. A. Choi and B. Narahari, Algorithms for mapping and partitioning chain structured parallel computations, in "Proceedings of the International Conference on Parallel Processing," Vol. 1, pp. 625-628, 1991.
6. V. Chvátal, A greedy heuristic for the set covering problem, Math. Oper. Res. 4 (1979), 233-235.
7. 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, NJ, 1988.
8. D. R. Gaur, T. Ibaraki, and R. Krishnamurti, Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem, in "Proceedings of the Eighth Annual European Symposium of Algorithms," Lecture Notes in Computer Science, Vol. 1879, pp. 211-219, Springer-Verlag, Berlin/New York, 2000.
9. 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, Vol. 1117, pp. 319-326, Springer-Verlag, Berlin/New York, 1996.
10. R. Hassin and N. Megiddo, Approximation algorithms for hitting objects with straight lines. Discrete Appl. Math. 30 (1991), 29-42.
11. D. S. Hochbaum, Approximation algorithms for the set covering and vertex cover problem, SIAM J. Comput. 11 (1982), 555-556.
12. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. Syst. Sci. 9 (1974), 256-278.
13. S. Khanna, S. Muthukrishnan, and S. Skiena, Efficient array partitioning, in "Proceedings of the 24th International Colloquium on Automata, Languages and Programming," Lecture Notes in Computer Science, Vol. 1256, pp. 616-626, Springer-Verlag, Berlin/New York, 1997.
14. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41 (1994), 960-981.
15. G. Nemhauser and L. Wolsey, "Integer and Combinatorial Optimization," Wiley-Interscience, New York, 1988.
16. D. M. Nicol, Rectilinear partitioning of irregular data parallel computations, J. Parallel Distributed Comput. 23 (1994), 119-134.
17. D. M. Nicol and D. R. O'Hallaron, Improved algorithms for mapping parallel and pipelined computations, IEEE Trans. Comput. 40, No. 3 (1991), 295-306.
18. E. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs, Oper. Res. 34 (1986), 250-256.