Skip to main content
SpringerLink
Log in

A limited-backtrack greedy schema for approximation algorithms

  • Algorithms
  • Conference paper
  • First Online:
Foundation of Software Technology and Theoretical Computer Science (FSTTCS 1994)

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

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. P. Berman and V. Ramaiyer, “Improved approximations for the Steiner tree problem”, in Proc. 3rd Annual Symposium on Discrete Algorithms, (1992) 325–334.

    Google Scholar 

  2. A. Blum, T. Jiang, M. Li, J. Tromp and M. Yannakakis, “Linear approximation of superstrings”, in Proc. 23rd Annual ACM Symposium on Theory of Computing, (1991) 328–336.

    Google Scholar 

  3. J. Edmonds, “Paths, trees and flowers,” Canadian J. Math. 17 (1957) 449–467.

    Google Scholar 

  4. M.R Garey and D.S. Johnson, “Computers and Intractability: A guide to the Theory of N P-Completeness”, W.H. Freeman & Co., San Francisco, 1979.

    Google Scholar 

  5. C. Greene and T.L. Magnanti, “Some abstract pivot algorithms”, Working Paper OR 037-74,(1974), Operations Research Center, MIT,USA.

    Google Scholar 

  6. L. Lovász and M. Plummer, Matching Theory, Academic Press, Budapest, Hungary, 1986.

    Google Scholar 

  7. H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica.

    Google Scholar 

  8. J. Tarhio and E. Ukkonen, “A greedy approximation algorithm for constructing shortest common superstrings,” Theoretical Computer Science 57 (1988) 131–145.

    Google Scholar 

  9. A. Z. Zelikovsky, “A 11/6 algorithm for the Steiner problem on networks”, to appear in Information and Computation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Indian Institute of Technology, 110016, New Delhi

    Vivek Arora, Vempala Santosh, Huzur Saran & Vijay V. Vazirani

Authors
  1. Vivek Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vempala Santosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huzur Saran
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. S. Thiagarajan

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arora, V., Santosh, V., Saran, H., Vazirani, V.V. (1994). A limited-backtrack greedy schema for approximation algorithms. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_134

Download citation

  • DOI: https://doi.org/10.1007/3-540-58715-2_134

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58715-6

  • Online ISBN: 978-3-540-49054-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation