Skip to main content
SpringerLink
Log in

On Given Diameter MST Problem on Random Input Data

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1090))

Abstract

We give an approximation deterministic algorithm for solving the Random MST with given diameter of directed graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Angel, O., Flaxman, A.D., Wilson, D.B.: A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. arXiv:0810.4908v2 [math.PR], 5 May 2011

  2. Cooper, C., Frieze, A., Ince, N., Janson, S., Spencer, J.: On the length of a random minimum spanning tree. Comb. Probab. Comput. 25(1), 89–107 (2016)

    Article  MathSciNet  Google Scholar 

  3. Frieze, A.: On the value of a random MST problem. Discrete Appl. Math. 10, 47–56 (1985)

    Article  MathSciNet  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  5. Gimadi, E.Kh., Perepelitsa, V.A.: Asymptotic approach for solving the traveling salesman problem. Upravlyaemye Sistemy 12, 35–45 (1974). (in Russian)

    Google Scholar 

  6. Gimadi, E.Kh., Glebov, N.I., Perepelitsa, V.A.: Algorithms with estimates for discrete optimization problems. Problemy Kibernetiki 31, 35–42 (1974). (in Russian)

    Google Scholar 

  7. Gimadi, E.K., Serdyukov, A.I.: A probabilistic analysis of an approximation algorithm for the minimum weight spanning tree problem with bounded from below diameter. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds.) Operations Research Proceedings 1999. ORP, vol. 1999, pp. 63–68. Springer, Heidelberg (2000). https://doi.org/10.1007/978-3-642-58300-1_12

    Chapter  Google Scholar 

  8. Gimadi, E.K., Shin, E.Y.: Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below. J. Appl. Ind. Math. 9(4), 480–488 (2015)

    Article  MathSciNet  Google Scholar 

  9. Gimadi, E.Kh., Istomin, A., Shin, E.: On algorithm for the minimum spanning tree problem bounded below. In: Proceedings DOOR 2016, Vladivostok, Russia, 19–23 September 2016. CEUR-WS, vol. 1623, pp. 11–17 (2016)

    Google Scholar 

  10. Perepelitsa, V.A., Gimadi, E.Kh.: Problem of finding the minimum hamiltonian cycle in a weighted graph. Discrete Anal. 15, 57–65 (1969). (Inst. Math., Novosibirsk) (in Russian)

    Google Scholar 

  11. Slominski, L.: Probabilistic analysis of combinatorial algorithms: a bibliography with selected annotations. Computing 28, 257–267 (1982)

    Article  MathSciNet  Google Scholar 

  12. Petrov V.V.: Limit Theorems of Probability Theory. Sequences of Independent Random Variables, p. 304. Clarendon Press, Oxford (1995)

    Google Scholar 

Download references

Acknowledgments

The authors are supported by the program of fundamental scientific researches of the SB RAS, project 0314-2019-0014 and by the Ministry of Science and Higher Education of the Russian Federation under the 5–100 Excellence Programme.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090, Novosibirsk, Russia

    Edward Kh. Gimadi

  2. Novosibirsk State University, 2 Pirogova Str., 630090, Novosibirsk, Russia

    Edward Kh. Gimadi & Ekaterina Yu. Shin

Authors
  1. Edward Kh. Gimadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ekaterina Yu. Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Edward Kh. Gimadi .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Igor Bykadorov

  2. University of Greenwich, London, UK

    Vitaly Strusevich

  3. University of Aveiro, Aveiro, Portugal

    Tatiana Tchemisova

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gimadi, E.K., Shin, E.Y. (2019). On Given Diameter MST Problem on Random Input Data. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2019. Communications in Computer and Information Science, vol 1090. Springer, Cham. https://doi.org/10.1007/978-3-030-33394-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33394-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33393-5

  • Online ISBN: 978-3-030-33394-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation