Author:
Guan Li,Li Jianping,Zhang Xuejie,Li Weidong
Publisher
Springer International Publishing
Reference16 articles.
1. Becchetti, L., Ianni, M.D., Spaccamela, A.M.: Approximation algorithms for routing and call scheduling in all-optical chains and rings. Theoretical Computer Science 287(2), 429–448 (2002)
2. Frank, A., Nishizeki, T., Saito, N., Suzuki, H., Tardos, E.: Algorithms for routing around a rectangle. Discrete Applied Mathematics 40(3), 363–378 (1992)
3. Ganley, J.L., Cohoon, J.P.: Minimum-congestion hypergraph embedding in a cycle. IEEE Transactions on Computers 46(5), 600–602 (1997)
4. Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to The Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)
5. Gonzalez, T.: Improved approximation algorithm for embedding hyperedges in a cycle. Information Processing Letters 67(5), 267–271 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献