Skip to main content
SpringerLink
Log in

Robustness of minimum cost arborescences

  • Original Paper
  • Area 1
  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

The minimum cost arborescence problem is a directed graph analogue of the minimum spanning tree problem in an undirected graph. In this paper, we study the minimum cost arborescence problem from the viewpoint of robustness of the optimal objective value, and we characterize an input graph in which the optimal objective value does not change even if we remove several arcs.

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. Bang-Jensen J., Gutin G.Z.L: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Berlin (2008)

    Google Scholar 

  2. Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. In: Developments in Operations Research, pp. 29–44. Gordon and Breach, New York (1971)

  3. Chu Y., Liu T.: On the shortest arborescence of a directed graph. Scientia Sinica 14, 1396–1400 (1965)

    MathSciNet  MATH  Google Scholar 

  4. Edmonds J.: Optimum branchings. J. Res. Nat. Bur. Stand. Sect. B 71B, 233–240 (1967)

    MathSciNet  Google Scholar 

  5. Edmonds J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J. (eds) Combinatorial Structures and Their Applications., pp. 69–87. Gordon and Breach, New York (1970)

    Google Scholar 

  6. Edmonds, J.: Edge-disjoint branchings. In: Combinatorial Algorithms, pp. 91–96. Academic Press, New York (1973)

  7. Frank A.: A weighted matroid intersection algorithm. J. Algorithms 2(4), 328–336 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fulkerson D.R.: Packing rooted directed cuts in a weighted directed graph. Math. Program. 6, 1–13 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gabow H.N., Galil Z., Spencer T., Tarjan R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109–122 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gravin N., Chen N.: A note on k-shortest paths problem. J. Gr. Theory 67(1), 34–37 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kamiyama N., Katoh N., Takizawa A.: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Dis. Appl. Math. 157(17), 3665–3677 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Li Y., Thai M.T., Wang F., Du D.-Z.: On the construction of a strongly connected broadcast arborescence with bounded transmission delay. IEEE Transact. Mobile Comput. 5(10), 1460–1470 (2006)

    Article  Google Scholar 

  13. Schrijver A.: Theory of Linear and Integer Programming. Wiley, New Jersy (1986)

    MATH  Google Scholar 

  14. Schrijver A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)

    MATH  Google Scholar 

  15. Shigeno M., Iwata S.: A dual approximation approach to weighted matroid intersection. Oper. Res. Lett. 18(3), 153–156 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics for Industry, Kyushu University, Fukuoka, 819-0395, Japan

    Naoyuki Kamiyama

Authors
  1. Naoyuki Kamiyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naoyuki Kamiyama.

Additional information

Preliminary version of this paper has appeared in Proceedings of 22nd International Symposium on Algorithms and Computation (ISAAC’11), Lecture Notes in Computer Science 7074 (2011) pp.130–139. Partly supported by a Grant-in-Aid for Scientific Research (22700016) from Japan Society for the Promotion of Science.

About this article

Cite this article

Kamiyama, N. Robustness of minimum cost arborescences. Japan J. Indust. Appl. Math. 29, 485–497 (2012). https://doi.org/10.1007/s13160-012-0079-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13160-012-0079-8

Keywords

Mathematics Subject Classification

Search

Navigation