Titlebook: Algorithmic Aspects in Information and Management; 6th International Co Bo Chen Conference proceedings 2010 Springer-Verlag Berlin Heidelbe

Osteopenia

书目名称Algorithmic Aspects in Information and Management影响因子(影响力)




书目名称Algorithmic Aspects in Information and Management影响因子(影响力)学科排名




书目名称Algorithmic Aspects in Information and Management网络公开度




书目名称Algorithmic Aspects in Information and Management网络公开度学科排名




书目名称Algorithmic Aspects in Information and Management被引频次




书目名称Algorithmic Aspects in Information and Management被引频次学科排名




书目名称Algorithmic Aspects in Information and Management年度引用




书目名称Algorithmic Aspects in Information and Management年度引用学科排名




书目名称Algorithmic Aspects in Information and Management读者反馈




书目名称Algorithmic Aspects in Information and Management读者反馈学科排名

PHONE

The (,,,)-Capacitated Spanning Tree Problem,This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity ., and the others have capacity . < .. We prove that the problem can be approximated within a constant factor, and present better approximations when . is 1 or 2.

Glaci冰

https://doi.org/10.1007/978-3-642-14355-7DNA matching; algorithms; artificial intelligence; graph coloring; nearest neighbour; risk management; roa

顽固

978-3-642-14354-0Springer-Verlag Berlin Heidelberg 2010

骚动

Algorithmic Aspects in Information and Management978-3-642-14355-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

鞭打

2.5.4 Chloroiodo- and Fluoroiodoalkanes,the ergodic theory of Markov processes. We compare in detail the link graph used in PageRank and the user browsing graph used in BrowseRank. Along with the comparison, the importance of the metadata contained in the user browsing graph is explored.

gorgeous

2.5.4 Chloroiodo- and Fluoroiodoalkanes,ves an approximation ratio of roughly 0.842 and runs in .(...) time, where . (respectively, .) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was ..

Myofibrils

进取心

取消

Approximating Maximum Edge 2-Coloring in Simple Graphs,ves an approximation ratio of roughly 0.842 and runs in .(...) time, where . (respectively, .) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was ..