Parallel approximation schemes for problems on planar graphs

Acta Informatica

Volumn 33, Issue 4, 1996, Pages 387-408

  Diaz J ^a   Serna, M J ^a   Toran J ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040753945     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050049     Document Type: Article

References (24)

1. Abrahamson, K., Dadoun, N., Kirkpatrick, D., Przytycka, K.: A simple parallel tree contraction algorithm. J. Algorithms, 10, 287-302 (1989)
2. Anderson, R.J., Mayr, E.W.: Approximating P-complete problems. Technical report, Stanford University, 1986.
3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: 24th Ann. IEEE Symp. on Foundations of Computer Science, pp 265-273, 1983
4. Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153-180 (1994)
5. Bui, T.N., Peck, A.: Partitioning planar graphs. SIAM J. Comput. 21, 203-215 (1992)
6. Chrobak, M., Naor, J.: An efficient parallel algorithm for computing large independent set in a planar graph. In: First Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 379-387. New York: Assoc. Comput. Machinery 1989
7. Cohen, E.: Approximate max flow on small depth networks. In: 33rd Ann. IEEE Symp. on Foundations of Computer Science, pp. 648-658, 1992
8. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman 1979
9. Hagerup, T.: Planar depth-first search in log n parallel time. SIAM J. Comp. 19, 678-703 (1990)
10. Hirschberg, D.S., Chandra, A.K., Sarwate, D.V.: Computing connected components on parallel computers. Comm. ACM 22, 461-464 (1979)
11. JaJa, J.: An introduction to parallel algorithms. Reading, MA: Addison-Wesley 1992
12. Kann, V.: On the approximability of NP-complete optimization problems. Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden, 1992
13. Kant, G., Xin He: Two algorithms for finding rectangular duals of planar graphs. In: Proc. 19th Int. Workshop on Graph-Theoretic Concepts in Computer Science (Lect. Notes Comput. Sci., Vol. 790, pp. 411-424) Berlin, Heidelberg, New York: Springer 1994
14. Karp, R., Ramachandran, V.: Parallel algorithms for shared memory machines. In: Jan van Leeuwen (ed.) Handbook of theoretical computer science, Vol. A, pp. 869-942, Amsterdam: Elsevier 1990
15. Kirousis, L.M., Serna, M.J., Spirakis, P.: The parallel complexity of the connected subgraph problem. SIAM J. Comput. 22, 573-586 (1993)
16. Klein, P.H., Reif, J.H.: An efficient parallel algorithm for planarity. In: 27th Ann. IEEE Symp. on Foundations of Computer Science, pp. 465-477, 1986
17. Klein, P., Stein, C.: A parallel algorithm for approximating the minimum cycle cover. Algorithmica 9, 23-31 (1993)
18. Luby, M., Nisan, N.: A parallel approximation algorithm for positive linear programming. Technical report, International Computer Science Institute. Berkeley 1992
19. Nishizeki, T., Chiba, N.: Planar graphs: theory and algorithms. Amsterdam: North-Holland, 1988
20. Peters, J.G., Rudolph, L.: Parallel aproximation schemes for subset sum and knapsack problems. Acta Inf. 24, 417-432 (1987)
21. Ramachandran, V., Reif, J.: An optimal parallel algorithm for graph planarity. In 30th Ann. IEEE Symp. on Foundations of Computer Science, pp 282-287, 1989
22. Serna, M.J.: The parallel approximability of P-complete problems. Ph.D. thesis, Universitat Politecnica de Catalunya, 1990
23. Serna, M.J.: Approximating linear programming is log-space complete for P. Inform. Process. Lett. 37, 233-236 (1991)
24. Serna, M.J., Spirakis, P.: The approximability of problems complete for P. In: Proc. on Optimal Algorithms. (Lect. Notes Comput. Sci., vol. 401, pp. 193-204) Berlin, Heidelberg, New York: Springer 1989