Skip to main content
SpringerLink
Log in

Efficient algorithms for the minimum range cut problems

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1991)

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

Included in the following conference series:

  • 2010 Accesses

Extended abstract

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.M. Camerini, F. Mafioli, S. Martello, and P. Toth, Most and Least Uniform Spanning Trees. Discrete Applied Mathematics, Vol. 15, 181–197. 1986.

    Google Scholar 

  2. D. Cheriton and R.E. Tarjan, Finding Minimum Spanning Trees. SIAM Journal on Computing, Vol. 5, 724–742. 1976.

    Google Scholar 

  3. M.L. Fredman and D.E. Willard, Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. Proceedings of the IEEE 31st Annual Symposium on Foundations of Computer Science, 719–725. 1990.

    Google Scholar 

  4. H.N. Gabow, Z. Galil, T. Spencer, and R.E. Tarjan, Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs. Combinatorica, Vol. 6, No. 2, 109–122. 1986.

    Google Scholar 

  5. Z. Galil and B. Schieber, On Finding Most Uniform Spanning Trees. Discrete Applied Mathematics, Vol. 20, 173–175. 1987.

    Google Scholar 

  6. S. Martello, W.R. Pulleyblank, P. Toth, and D. de Werra, Balanced Optimization Problems. Operations Research Letters, Vol. 3, No. 5, 275–278. 1984.

    Google Scholar 

  7. C. Monma, M. Paterson, S. Suri, and F. Yao, Computing Euclidean Maximum Spanning Trees. Proceedings of the Fourth Annual ACM Symposium on Computational Geometry, 241–251. 1988.

    Google Scholar 

  8. F.P. Preparata and M.I. Shamos, Computational Geometry, Springer Verlag, New York, NY. 1985.

    Google Scholar 

  9. D.D. Sleator and R.E. Tarjan, A Data Structure for dynamic Trees. Journal of Computer and System Sciences, Vol. 26, 362–391. 1983.

    Google Scholar 

  10. R.E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA. 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science, Kobe University of Commerce, Gakuen-Nishimachi 8-2-1, Nishi-ku, 651-21, Kobe, Japan

    Naoki Katoh

  2. Tokyo Research Laboratory, IBM Japan, 5-11 Sanbancho, Chiyoda-ku, 102, Tokyo, Japan

    Kazuo Iwano

Authors
  1. Naoki Katoh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazuo Iwano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katoh, N., Iwano, K. (1991). Efficient algorithms for the minimum range cut problems. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028252

Download citation

  • DOI: https://doi.org/10.1007/BFb0028252

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54343-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation