Skip to main content
SpringerLink
Log in

Parallel approximation schemes for problems on planar graphs

Extended abstract

  • Conference paper
  • First Online:
Algorithms—ESA '93 (ESA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 726))

Included in the following conference series:

Abstract

This paper describes a technique to obtain NC Approximations Schemes for the Maximun Independent Set in planar graphs and related optimization problems.

This research was supported by the ESPRIT BRA Program of the EC under contract no. 7141,project ALCOM II.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.J. Anderson and E.W. Mayr. Approximating P-complete problems. Technical report, Stanford University, 1986.

    Google Scholar 

  2. B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. In 24 IEEE Symposium on Foundations of Computer Science, pages 265–273, 1983.

    Google Scholar 

  3. M. Chrobak and J. Naor. An efficient parallel algorithm for computing large independent set in a planar graph. In SPAA-89, pages 379–387. Association for Computing Machinery, 1989.

    Google Scholar 

  4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.

    Google Scholar 

  5. T. Hagerup. Planar depth-first search in log n parallel time. SIAM Journal on Computing, 19:678–703, 1990.

    Google Scholar 

  6. P.H. Klein and J.H. Reif. An efficient parallel algorithm for planarity. In IEEE Symposium on Foundations of Computer Science, pages 465–477. IEEE Society, 1986.

    Google Scholar 

  7. R. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In Jan van Leewen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 869–942. Elsevier Science Publishers, 1990.

    Google Scholar 

  8. P. Klein and C. Stein. A parallel algorithm for approximating the minimum cycle cover. Algorithmica, 9:23–31, 1993.

    Google Scholar 

  9. L.M. Xirousis, M.J. Serna, and P. Spirakis. The parallel complexity of the connected subgraph problem. In 30th. IEEE Symposium on Foundations of Computer Science, pages 446–456. IEEE, 1989.

    Google Scholar 

  10. M. Luby and N. Nisan. A parallel approximation algorithm for positive linear programming. Technical report, International Computer Science Institute, Berkeley, 1992.

    Google Scholar 

  11. J.G. Peters and L. Rudolph. Parallel approximation schemes for subset sum and knapsack problems. Acta Informatica, 24:417–432, 1987.

    Google Scholar 

  12. M.J. Serna. The parallel approximability of P-complete problems. PhD thesis, Universitat Politecnica de Catalunya, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament de Llenguatges i Sistemes, Universitat Politècnica Catalunya, Pau Gargallo 5, 08028, Barcelona

    J. Díaz, M. J. Serna & J. Torán

Authors
  1. J. Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. J. Serna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Torán
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Lengauer

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Díaz, J., Serna, M.J., Torán, J. (1993). Parallel approximation schemes for problems on planar graphs. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-57273-2_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57273-2

  • Online ISBN: 978-3-540-48032-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation