Skip to main content
SpringerLink
Log in

Heuristics for the central tree problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper addresses the central spanning tree problem (CTP). The problem consists in finding a spanning tree that minimizes the so-called robust deviation, i.e. deviation from a maximally distant tree. The distance between two trees is measured by means of the symmetric difference of their edge sets. The central tree problem is known to be NP-hard. We attack the problem with a hybrid heuristic consisting of: (1) a greedy construction heuristic to get a good initial solution and (2) fast local search improvement. We illustrate computationally efficiency of the proposed approach.

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

  • Amoia, A., Cottafava, G.: Invariance properties of central trees. IEEE Trans. Circuit Theory CT 18, 465–467 (1971)

    Article  MathSciNet  Google Scholar 

  • Aron, I., van Hentenryck, P.: A constraint satisfaction approach to the robust spanning tree with interval data. In: Proceedings of the 18th Conference on UAI, Edmonton, Canada, August 1–4, 2002

  • Aron, I., van Hentenryck, P.: On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32, 36–40 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Averbakh, I., Lebedev, V.: Interval data regret network optimization problems. Discrete Appl. Math. 138, 289–301 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London-Berlin-Heidelberg (2001)

    MATH  Google Scholar 

  • Bezrukov, S., Kaderali, F., Poguntke, W.: On central spanning trees of a graph. Lect. Notes Comput. Sci. 1120, 53–58 (1996)

    MathSciNet  Google Scholar 

  • Deo, N.: A central tree. IEEE Trans. Circuit Theory CT 13, 439–440 (1966)

    Article  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  • Kaderali, F.: A counterexample to the algorithm of Amoia and Cottafava for finding central trees. Technical Report FB 19, TH Darmstadt, June 1973, Preprint

  • Kasperski, A., Zielinski, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97, 177–180 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Kishi, G., Kajitani, Y.: Maximally distant trees and principal partition of a linear graph. IEEE Trans. Circuit Theory CT 16, 323–330 (1969)

    Article  MathSciNet  Google Scholar 

  • Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic, Norwell (1997)

    MATH  Google Scholar 

  • Kozina, G., Perepelitsa, V.: Interval spanning tree problem: solvability and computational complexity. Interval Comput. 1, 42–50 (1994)

    MathSciNet  Google Scholar 

  • Lee, Y.Y.: Use of compound matrices in topological analysis. Master‘s Thesis, Kansas State University, Manhatten, KS (1968)

  • Montemanni, R.: A Benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 174, 1479–1490 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Montemanni, R., Gambardella, L.: A branch and bound algorithm for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 161, 771–779 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math. 5, 54–66 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Nikulin, Y.: Robustness in combinatorial optimization and scheduling theory: an extended annotated bibliography. Manuskripte aus den Instituten für Betriebswirtschaftslehre No. 606, Christian-Albrechts-Universität zu Kiel, Germany (2006)

  • Nikulin, Y.: Simulated annealing algorithm for the robust spanning tree problem. J. Heuristics 14, 391–402 (2008)

    Article  MATH  Google Scholar 

  • Shinoda, S., Kawamoto, T.: Central trees and critical sets. In: Kirk, D.E. (ed.) Proceedings of the 14th Asilomar Conference on Circuit, Systems and Computers, vol. 108, Pacific Grove, California, pp. 183–187 (1980)

  • Shinoda, S., Kawamoto, T.: On central trees of a graph. In: Lecture Notes in Computer Science, vol. 108, pp. 137–151. Springer, Berlin (1981)

    Google Scholar 

  • Shinoda, S., Saishu, K.: Conditions for an incidence set to be a central tree. Technical Report CAS80-6, Institute of Electrical and Communication Engineering, Japan (1980)

  • Stoer, M., Wagner, F.: A simple mincut algorithm. In: Proc. of ESA94. Lecture Notes in Computer Science, vol. 855, pp. 141–147 (1994)

  • Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 142, 221–230 (1961)

    Article  MathSciNet  Google Scholar 

  • Yaman, H., Karasan, O., Pinar, M.: The robust spanning tree problem with interval data. Oper. Res. Lett. 29, 31–40 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark

    Jørgen Bang-Jensen

  2. Department of Mathematics, University of Turku, Turku, Finland

    Yury Nikulin

Authors
  1. Jørgen Bang-Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yury Nikulin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yury Nikulin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bang-Jensen, J., Nikulin, Y. Heuristics for the central tree problem. J Heuristics 16, 633–651 (2010). https://doi.org/10.1007/s10732-009-9111-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-009-9111-9

Keywords

Search

Navigation