close
Approximation, Randomization And Combinatorial Optimization: Algorithms and Techniques特惠價
網友評鑑5顆星，這是網路上最便宜的 在此介紹給您
博客來電腦-計算機概論 分類超值推薦
想了解更多[Approximation, Randomization And Combinatorial Optimization: Algorithms and Techniques]的內容嗎
點圖即可看詳細介紹
內容簡介
| This book constitutes the joint refereed proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and the 9th International Workshop on Randomization and Computation, RANDOM 2005, held in Berkeley, CA, USA in August 2005.The volume contains 41 carefully reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness. |
美金：119.00元
本類書籍銷售 Top 5
全站熱搜
留言列表
