Author:
Cerulli R.,Gentili M.,Iossa A.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference7 articles.
1. Broesma, H., Li, X.: Spanning Trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory 17, 259–269 (1997)
2. Cerulli, R., Fink, A., Gentili, M., Voß, S.: Metaheuristics comparison for the minimum labelling spanning tree problem. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Next Wave on Computing, Optimization, and Decision Technologies, pp. 93–106. Springer, New York (2005). [ISBN:0-387-23528-0]
3. Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: ICALP’ 02, Malága, Spain 2002
4. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 82–103. Plenum, New York (1972)
5. Klein, P., Ravi, R.: A nearly best-possible algorithm for node-weighted Steiner trees. J. Algorithms 19, 104–115 (1995)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献