Author:
Yang Zishen,Wang Wei,Kim Donghyun
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference32 articles.
1. Bazgan C, Escoffier B, Paschos VT (2005) Completeness in standard and differential approximation classes: poly-(D)APX- and (D)PTAS-completeness. Theor Comput Sci 339(2):272–292
2. Bienstock D (1991) Some generalized max-flow min-cut problems in the plane. Math Methods Oper Res 16(2):310–333
3. Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: Proceedings of the 11th international computing and combinatorics conference (COCOON)
4. Cai Z, Chen Z, Lin G, Wang L (2008) An improved approximation algorithm for the capacitated multicast tree routing problem, Accepted by the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA )
5. Cai Z, Chen Z, Lin G (2009) A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theor Comput Sci 410(52):5415–5424 (IF: 1.085)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献