The Maximum Labeled Path Problem
暂无分享,去创建一个
[1] Jérôme Monnot. The labeled perfect matching in bipartite graphs , 2005, Inf. Process. Lett..
[2] Gerhard J. Woeginger,et al. Local search for the minimum label spanning tree problem with bounded color classes , 2003, Oper. Res. Lett..
[3] Lynn Batten. Combinatorics of Finite Geometries , 1986 .
[4] Jérôme Monnot,et al. Labeled Traveling Salesman Problems: Complexity and approximation , 2010, Discret. Optim..
[5] Gerhard J. Woeginger,et al. Paths and cycles in colored graphs , 2001, Australas. J Comb..
[6] Sven Oliver Krumke,et al. On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..
[7] Refael Hassin,et al. Approximation algorithms and hardness results for labeled connectivity problems , 2007, J. Comb. Optim..
[8] Refael Hassin,et al. The Complexity of Bottleneck Labeled Graph Problems , 2007, WG.
[9] Xueliang Li,et al. Spanning trees with many or few colors in edge-colored graphs , 1997, Discuss. Math. Graph Theory.
[10] Ruay-Shiung Chang,et al. The Minimum Labeling Spanning Trees , 1997, Inf. Process. Lett..
[11] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.