Skip to main content
SpringerLink
Log in

Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We consider the graphs with matrices whose entries (i.e., the weights of edges) are randomly and independently chosen in an interval unbounded above and with a continuous distribution function. Probabilistic analysis is carried out of an approximation algorithm with quadratic time complexity for an exponential distribution. Some sufficient conditions for the asymptotic optimality of the algorithmare justified. Similar conditions are also obtained for a truncated normal distribution.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Kh. Gimadi and Yu. V. Glazkov, “An Asymptotically Optimal Algorithm for One Modification of Planar Three-Index Assignment Problem,” Diskretn. Anal. Issled. Oper. Ser. 2, 13 (1), 10–26 (2006) [J. Appl. Indust. Math. 1 (4), 442–452 (2007)].

    MATH  Google Scholar 

  2. E. Kh. Gimadi, A. Le Gallou, and A. V. Shakhshneyder, “Probabilistic Analysis of an Approximation Algorithm for the Traveling Salesman Problem on Unbounded Above Instances,” Diskretn. Anal. Issled. Oper. 15 (1), 23–43 (2008) [J. Appl. Indust. Math. 3 (2), 207–221 (2009)].

    MATH  MathSciNet  Google Scholar 

  3. E. Kh. Gimadi and V. A. Perepelitsa, “An Asymptotic Approach to the Traveling Salesman Problem,” in Controlled Systems, Vol. 12 (Inst.Mat., Novosibirsk, 1974), pp. 35–45.

    Google Scholar 

  4. E. Kh. Gimadi and A. I. Serdyukov, “An Algorithm for Finding the Minimum Spanning Tree with a Diameter Bounded Below,” Diskretn. Anal. Issled. Oper. Ser. 1, 7 (2), 3–11 (2000).

    MATH  MathSciNet  Google Scholar 

  5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir,Moscow, 1982).

    MATH  Google Scholar 

  6. V. A. Perepelitsa and E. Kh. Gimadi, “The Minimum Hamiltonian Cycle Problem in a Weighted Graph,” in Discrete Analysis, Vol. 15 (Inst. Mat., Novosibirsk, 1969), pp. 57–65.

    Google Scholar 

  7. V. V. Petrov, Limit Theorems for Sums of Independent Random Variables (Nauka, Moscow, 1987) [in Russian].

    MATH  Google Scholar 

  8. R. C. Prim, “Shortest Connection Networks and Some Generalizations,” Bell Syst. Techn. J. 36 (6), 1389–1401 (1957) [Cybernetic Collection, Vol. 2 (Mir,Moscow, 1961), pp. 95–107].

    Article  Google Scholar 

  9. A. Abdalla, N. Deo, and P. Gupta, “Random-Tree Diameter and the Diameter Constrained MST,” Congr. Numerantium 144, 161–182 (2000).

    MATH  MathSciNet  Google Scholar 

  10. D. J. Bertsimas, “The ProbabilisticMinimum Spanning Tree Problem,” Networks 20 (3), 245–275 (1990).

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Gruber and G. R. Raidl, “A New 0-1 ILP Approach for the Bounded-Diameter Minimum Spanning Tree Problem,” in Proceedings of the 2nd International Network Optimization Conference (Lisbon, Portugal, March 20–23, 2005), Vol. 1 (Lisbon, 2005), pp. 178–185.

    Google Scholar 

  12. D. S. Johnson, J. K. Lenstra, and A. H. G. Rinnooy Kan, “The Complexity of the Network Design Problem,” Networks 8 (4), 279–285 (1978).

    Article  MATH  MathSciNet  Google Scholar 

  13. B. A. Julstrom, “Greedy Heuristics for the Bounded-Diameter Minimum Spanning Tree Problem,” ACM J. Exp. Algorithmics 14, 1–14 (2009).

    MathSciNet  Google Scholar 

  14. B. A. Julstromand G. R. Raidl, “A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem,” in Genetic and Evolutionary Computation Conference GECCO’s Workshops Proceedings, Workshop on Analysis and Design of Representations and Operators, (Chicago, USA, July 12–16, 2003), pp. 2–7 [see also https://www.ac.tuwien.ac.at/files/pub/julstrom-03.pdf].

  15. K. Ozeki and T. Yamashita, “Spanning Trees: A Survey,” Graphs Comb. 27 (1), 1–26 (2011).

    Article  MATH  MathSciNet  Google Scholar 

  16. G. R. Raidl and B. A. Julstrom, “GreedyHeuristics and an Evolutionary Algorithmfor the Bounded-Diameter Minimum Spanning Tree Problem,” in Proceedings of 2003 ACM Symposium on Applied Computing (Melbourne, FL, USA, March 9–12, 2003) (ACM, New York, 2003), pp. 747–752.

    Chapter  Google Scholar 

  17. R. Jothi and B. Raghavachari, “Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design,” ACM Trans. Algorithms 1 (2), 265–282 (2005).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    E. Kh. Gimadi & E. Yu. Shin

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

    E. Kh. Gimadi

Authors
  1. E. Kh. Gimadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Yu. Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to E. Kh. Gimadi or E. Yu. Shin.

Additional information

Original Russian Text © E.Kh. Gimadi, E.Yu. Shin, 2015, published in Diskretnyi Analiz i Issledovanie Operatsii, 2015, Vol. 22, No. 4, pp. 5–17.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

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, 480–488 (2015). https://doi.org/10.1134/S1990478915040043

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478915040043

Keywords

Search

Navigation