Advertisement

Sensitivity Analysis for Spanning Tree

  • K. Kavitha
  • D. AnuradhaEmail author
Conference paper
Part of the Trends in Mathematics book series (TM)

Abstract

This paper develops a heuristic procedure for finding the maximum increment and decrement of each edge weight separately without modifying the optimality of minimum spanning tree. The procedure of the proposed approach is illustrated by numerical example.

References

  1. 1.
    Andreae, T. (2001) On the travelling salesman problem restricted to inputs satisfying a relaxed triangle inequality’, Networks, Vol. 38, pp. 59–67.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Anuradha, D. and Bhavani, .S (2013), ?Multi Perspective Metrics for Finding All Efficient Solutions to Bi-Criteria Travelling Salesman Problem’, International Journal of Engineering and Technology, Vol. 5, No. 2, pp. 1682–1687.Google Scholar
  3. 3.
    Bhide, S. John, N. Kabuka, M.R. (1993) ?A Boolean Neural Network Approach for the Traveling Salesman Problem’, IEEE Transactions on Computers, Vol. 42, pp. 1271–1278.Google Scholar
  4. 4.
    Blaser, M., Manthey, B. and Sgall, J. (2006) ?An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality’, Journal of Discrete Algorithms, Vol. 4, pp. 623–632.zbMATHGoogle Scholar
  5. 5.
    Bockenhauer, H.J., Hromkovi, J., Klasing, R., Seibert, S. and Unger, W. (2002) ‘Towards the notion of stability of approximation for hard optimization tasks and the travelling salesman problem’, Theoretical Computer Science, Vol. 285, pp. 3–24.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Dantzig, G., Fulkerson, R. and Johnson, S. (1954) ?Solution of a large-scale Traveling-salesman problem’, Journal of the Operations Research Society of America, Vol. 2, pp.393–410.Google Scholar
  7. 7.
    Geoffrion, A.M. and Nauss, R. (1977) ?Parametric and post optimality analysis in integer programming’, Management Sci., Vol. 23, pp. 453–466.zbMATHGoogle Scholar
  8. 8.
    Kavitha, K. Anuradha, D. (2015) ‘Heuristic Algorithm for finding Sensitivity Analysis of a More for Less Solution to Transportation Problems’, Global Journal of Pure and Applied Mathematics, Vol.11, pp.479–485.Google Scholar
  9. 9.
    Lucia Cabulea, (2006) ‘Sensitivity analysis of costs in a transportation problem’, ICTAMI, Alba Iulia, Romania, Vol.11, pp. 39–46.Google Scholar
  10. 10.
    Marek Libura (1986) ‘Sensitivity analysis of optimal solution for minimum Hamiltonian path’, Zeszyty Nauk. Politech. Slaskiej: Automatyka , Vol. 84, pp. 131–139.Google Scholar
  11. 11.
    Marek Libura (1991), ‘Sensitivity analysis for Hamiltonian path and travelling salesman problems, Discrete Applied Mathematics’, Vol. 30, pp. 197–211.MathSciNetCrossRefGoogle Scholar
  12. 12.
    Moritz Niendorf and Anouck R. Girard, (2016), ‘Robustness of communication links for teams of unmanned aircraft by sensitivity analysis of minimum spanning trees’ American control conference,pp.4623–4629.Google Scholar
  13. 13.
    Narsingh Deo, (2011) ‘Graph Theory with Applications to Engineering and Computer Science’, Eastern Economy Edition.Google Scholar
  14. 14.
    Pettie, S. (2006), ‘An inverse-Ackermann type lower bound for online minimum spanning tree verification’, Combinatorica, Vol.26, No. 2, pp. 207–230.MathSciNetCrossRefGoogle Scholar
  15. 15.
    Pettie, S. (2015), ‘Sensitivity analysis of minimum trees in sub inverse Ackermann time’, Journal of Graph algorithms and application, Vol.19, No.1, pp. 375–391.MathSciNetCrossRefGoogle Scholar
  16. 16.
    Tarjan, R.E. (1982), ‘Sensitivity analysis of minimum spanning trees and shortest path trees’, Inform. Process. Lett. Vol. 14, pp. 30–33.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Mathematics, School of Advanced SciencesVIT UniversityVelloreIndia

Personalised recommendations