Titlebook: Combinatorial Optimization and Applications; 11th International C Xiaofeng Gao,Hongwei Du,Meng Han Conference proceedings 2017 Springer Int

小故障

书目名称Combinatorial Optimization and Applications影响因子(影响力)




书目名称Combinatorial Optimization and Applications影响因子(影响力)学科排名




书目名称Combinatorial Optimization and Applications网络公开度




书目名称Combinatorial Optimization and Applications网络公开度学科排名




书目名称Combinatorial Optimization and Applications被引频次




书目名称Combinatorial Optimization and Applications被引频次学科排名




书目名称Combinatorial Optimization and Applications年度引用




书目名称Combinatorial Optimization and Applications年度引用学科排名




书目名称Combinatorial Optimization and Applications读者反馈




书目名称Combinatorial Optimization and Applications读者反馈学科排名

Airtight

Mortar

Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees

gentle

Protein Mover’s Distance: A Geometric Framework for Solving Global Alignment of PPI Networksconsists of two steps, Embedding and Matching. For the embedding step, we apply three different graph embedding techniques to preserve the topological structures of the original PPI networks. For the matching step, we compute a rigid transformation for one of the embedded PPI networks so as to minim

braggadocio

抵押贷款

0302-9743 ference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017...The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics

抵押贷款

MILK

愤怒事实

https://doi.org/10.1007/b119213 further propose a data replication algorithm which is a unified method, integrating data aggregation and data redistribution. Extensive simulations show that our proposed algorithms significantly outperform than existing algorithms especially in extending the lifetime of the sensor network.

陶瓷

Smart Antenna Systems and Wireless LANsrespect to .. The algorithm is based on the reverse search method, and enumerates all feasible floorplans in . time using .(.) space where . is the set of the feasible floorplans of . with respect to ., while the known algorithms need either . time and .(.) space or . time and . space.