Author:
Chen Xujin,Hu Xiaodong,Shuai Tianping
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference16 articles.
1. Bellare M, Goldreich O, Sudan M (1998) Free bits and nonapproximability–towards tight results, SIAM Journal on Computing 27:804–915
2. Chen X-J, Hu X-D, Jia X-H (2005) Complexity of minimal tree routing and coloring, Lecture Notes in Computer Science 3521:6–15
3. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company
4. Gu J, Hu X-D, Jia X-H, Zhang M-H (2004) Routing algorithm for multicast under multi-tree model in optical networks, Theoretical Computer Science 314:293–301
5. Gupta UI, Lee DT, Leung Y-T (1982) Efficient algorithms for interval graphs and circular-arc graphs, Networks 12:459–467
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献