![](/images/ico/ico_close.png)
![](/images/ico/ico3.png)
Period of time: 2014年3期
Publisher: Springer Publishing Company
Founded in: 1997
Total resources: 39
ISSN: 1382-6905
Subject: O Mathematical Sciences and Chemical
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of Combinatorial Optimization,volume 9,issue 3
Menu
![](/images/ico/ico5.png)
On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks
By Cai Hongxu,Zhao Yingchao in (2005)
Journal of Combinatorial Optimization,volume 9,issue 3 , Vol. 9, Iss. 3, 2005-05 , pp.![](/images/ico/ico5.png)
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls
By Fu Hung-Lin,Hwang Frank in (2005)
Journal of Combinatorial Optimization,volume 9,issue 3 , Vol. 9, Iss. 3, 2005-05 , pp.![](/images/ico/ico5.png)
By Chen Xujin,Hu Zhiquan,Zang Wenan in (2005)
Journal of Combinatorial Optimization,volume 9,issue 3 , Vol. 9, Iss. 3, 2005-05 , pp.![](/images/ico/ico5.png)
The Polymatroid Steiner Problems
By Calinescu G.,Zelikovsky A. in (2005)
Journal of Combinatorial Optimization,volume 9,issue 3 , Vol. 9, Iss. 3, 2005-05 , pp.![](/images/ico/ico5.png)
On the Hardness of Approximating the Min-Hack Problem
By Chinchani Ramkumar,Ha Duc,Iyer Anusha,Ngo Hung,Upadhyaya Shambhu in (2005)
Journal of Combinatorial Optimization,volume 9,issue 3 , Vol. 9, Iss. 3, 2005-05 , pp.![](/images/ico/ico5.png)
A Framework for the Complexity of High-Multiplicity Scheduling Problems
By Brauner N.,Crama Y.,Grigoriev A.,Klundert J. in (2005)
Journal of Combinatorial Optimization,volume 9,issue 3 , Vol. 9, Iss. 3, 2005-05 , pp.