Author:
Li Jianping,Li Kang,Law Ken C. K.,Zhao Hao
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics 59, 225–235 (1995)
2. Carpenter, T., Cosares, S., Ganley, J.L., Saniee, I.: A simple approximation algorithm for two problems in circuit design. IEEE Trans. Compt. 47(11), 1310–1312 (1998)
3. Lecture Notes in Computer Science;X.T. Deng,2004
4. Ganley, J.L., Cohoon, J.P.: Minimum-congestion hypergraph embedding in a cycle. IEEE Trans. Comput. 46(5), 600–602 (1997)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)