Probabilistic Combinatorial Optimization On Graphs
商品資訊
商品簡介
Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.
作者簡介
Vangelis Th. Paschos is Professor of Computer Science at the University of Paris-Dauphine and Chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include complexity theory, the theory of the polynomial approximation of NP-hard problems, probabilistic combinatorial optimization and on-line computation. He is the author of more than a 100 research papers and is a member of the editorial board of several international scientific journals.
目次
Chapter 1. A Short Insight into Probabilistic Combinatorial Optimization.
Chapter 2. The Probabilistic Maximum Independent Set.
Chapter 3. The Probabilistic Minimum Vertex Cover.
Chapter 4. The Probabilistic Longest Path.
Chapter 5. Probabilistic Minimum Coloring.
Chapter 6. Classification of Probabilistic Graph-problems.
Chapter 7. A Compendium of Probabilistic NPO Problems on Graphs.
Appendix A. Mathematical Preliminaries.
Appendix B. Elements of the Complexity and the Approximation Theory.
Bibliography.
Index.
您曾經瀏覽過的商品
購物須知
外文書商品之書封，為出版社提供之樣本。實際出貨商品，以出版社所提供之現有版本為主。部份書籍，因出版社供應狀況特殊，匯率將依實際狀況做調整。
無庫存之商品，在您完成訂單程序之後，將以空運的方式為你下單調貨。為了縮短等待的時間，建議您將外文書與其他商品分開下單，以獲得最快的取貨速度，平均調貨時間為1~2個月。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。