![](/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 21,issue 3
Menu
![](/images/ico/ico5.png)
![](/images/ico/ico5.png)
Approximation algorithms for multicast routing in ad hoc wireless networks
Journal of Combinatorial Optimization,volume 21,issue 3 , Vol. 21, Iss. 3, 2011-04 , pp.![](/images/ico/ico5.png)
The k -coloring fitness landscape
Journal of Combinatorial Optimization,volume 21,issue 3 , Vol. 21, Iss. 3, 2011-04 , pp.![](/images/ico/ico5.png)
Hardness and algorithms for rainbow connection
By Chakraborty Sourav in (2011)
Journal of Combinatorial Optimization,volume 21,issue 3 , Vol. 21, Iss. 3, 2011-04 , pp.![](/images/ico/ico5.png)
Data aggregation for p -median problems
Journal of Combinatorial Optimization,volume 21,issue 3 , Vol. 21, Iss. 3, 2011-04 , pp.![](/images/ico/ico5.png)
Approximating k -generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization,volume 21,issue 3 , Vol. 21, Iss. 3, 2011-04 , pp.![](/images/ico/ico5.png)
On the generalized constrained longest common subsequence problems
Journal of Combinatorial Optimization,volume 21,issue 3 , Vol. 21, Iss. 3, 2011-04 , pp.