Author:
Chatti Hatem,Gourvès Laurent,Monnot Jérôme
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Bazgan, C., Hassin, R., Monnot, J.: Approximation Algorithms for Some Routing Problems. Discrete Applied Mathematics 146, 3–26 (2005)
2. Broersma, H., Li, X.: Spanning Trees with Many or Few Colors in Edge-Colored Graphs. Discussiones Mathematicae Graph Theory 17(2), 259–269 (1997)
3. Chang, R.-S., Leu, S.-J.: The Minimum Labeling Spanning Trees. Information Processing Letters 63(5), 277–282 (1997)
4. Lecture Notes in Computer Science;B. Couetoux,2008
5. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, CA (1979)