Author:
Cerulli Raffaele,Fink Andreas,Gentili Monica,Voß Stefan
Reference16 articles.
1. R. Battiti. Reactive search: Toward self-tuning heuristics. In V.J. Rayward-Smith, I. H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, pages 61–83. Wiley, Chichester, 1996.
2. H. Broersma and X. Li. Spanning trees with many or few colors in edge-colored graphs. Discussiones Mathematicae Graph Theory, 17:259–269, 1997.
3. H. Broersma, X. Li, and S. Zhang. Paths and cycles in colored graphs. Electronic Notes in Discrete Mathematics, 8, 2001.
4. T. Brüggemann, J. Monnot, and G.J. Woeginger. Local search for the minimum label spanning tree problem with bounded color classes. Operations Research Letters, 31:195–201, 2003.
5. R.-S. Chang and S.-J. Leu. The minimum labeling spanning trees. Information Processing Letters, 63:277–282, 1997.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献