Concepts of combinatorial optimizati...
Paschos, Vangelis Th.

 

  • Concepts of combinatorial optimization[electronic resource] /
  • 紀錄類型: 書目-語言資料,印刷品 : Monograph/item
    杜威分類號: 519.64
    書名/作者: Concepts of combinatorial optimization/ edited by Vangelis Th. Paschos.
    其他作者: Paschos, Vangelis Th.
    出版者: Hoboken : : Wiley,, 2014.
    面頁冊數: 1 online resource (409 p.)
    標題: Combinatorial optimization.
    標題: Programming (Mathematics)
    ISBN: 9781119005216
    ISBN: 1119005213
    ISBN: 9781119015185
    ISBN: 1119015189
    內容註: Cover; Title Page; Copyright; Contents; Preface; PART I: Complexity of CombinatorialOptimization Problems; Chapter 1: Basic Concepts in Algorithmsand Complexity Theory; 1.1. Algorithmic complexity; 1.2. Problem complexity; 1.3. The classes P, NP and NPO; 1.4. Karp and Turing reductions; 1.5. NP-completeness; 1.6. Two examples of NP-complete problems; 1.6.1. MIN VERTEX COVER; 1.6.2. MAX STABLE; 1.7. A few words on strong and weak NP-completeness; 1.8. A few other well-known complexity classes; 1.9. Bibliography; Chapter 2: Randomized Complexity; 2.1. Deterministic and probabilistic algorithms.
    摘要、提要註: Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts:- On the complexity of combinatorial optimization problems, presenting basics abo.
    電子資源: http://onlinelibrary.wiley.com/book/10.1002/9781119005216
評論
Export
取書館別
 
 
變更密碼
登入