Advertisement

Efficient algorithms for the minimum range cut problems

  • Naoki Katoh
  • Kazuo Iwano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    D. Cheriton and R.E. Tarjan, Finding Minimum Spanning Trees. SIAM Journal on Computing, Vol. 5, 724–742. 1976.Google Scholar
  3. [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. [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. [5]
    Z. Galil and B. Schieber, On Finding Most Uniform Spanning Trees. Discrete Applied Mathematics, Vol. 20, 173–175. 1987.Google Scholar
  6. [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. [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. [8]
    F.P. Preparata and M.I. Shamos, Computational Geometry, Springer Verlag, New York, NY. 1985.Google Scholar
  9. [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. [10]
    R.E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA. 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Naoki Katoh
    • 1
  • Kazuo Iwano
    • 2
  1. 1.Department of Management ScienceKobe University of CommerceKobeJapan
  2. 2.Tokyo Research Laboratory, IBM JapanTokyoJapan

Personalised recommendations