G. Gallo, G. Longo, S. Pallottino, and S. Nguyen, Directed hypergraphs and applications, Discrete applied mathematics, vol.42, issue.2, pp.177-201, 1993.

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, 1979.

P. W. Goldberg and A. Mccabe, Shortest Paths with Bundles and Non-additive Weights Is Hard, CIAC 2013, vol.7878, pp.264-275, 2013.

R. Hassin, J. Monnot, and D. Segev, Approximation algorithms and hardness results for labeled connectivity problems, Journal Combinatorial Optimization, vol.14, issue.4, pp.437-453, 2007.

J. Q. Hu, Diverse routing in optical mesh networks, IEEE Transactions on, vol.51, issue.3, pp.489-494, 2003.

S. Khot and O. Regev, Vertex cover might be hard to approximate to within 2-epsilon, Journal of Computer and System Sciences, vol.74, issue.3, pp.335-349, 2008.

S. O. Krumke and H. C. Wirth, On the minimum label spanning tree problem. Information Processing Letters, vol.66, pp.81-85, 1998.

G. Wachman and R. Khardon, Learning from interpretations: a rooted kernel for ordered hypergraphs, Proceedings of the 24th international conference on Machine learning, pp.943-950, 2007.

S. Yuan, S. Varma, and J. P. Jue, Minimum-color path problems for reliability in mesh networks, INFOCOM 2005, vol.4, pp.2658-2669, 2005.

P. Zhang, J. Y. Cai, L. Q. Tang, and W. B. Zhao, Approximation and hardness results for label cut and related problems, Journal Combinatorial Optimization, vol.21, issue.2, pp.192-208, 2011.