Knihobot

Xiaodong Hu

    Computing and combinatorics
    Design and Analysis of Approximation Algorithms
    • The textbook uniquely categorizes approximation algorithms by their design techniques, enabling readers to explore similar algorithms in a cohesive manner. This structured approach differentiates it from other theoretical computer science resources, facilitating a deeper understanding of the algorithms' underlying principles and applications.

      Design and Analysis of Approximation Algorithms
    • Computing and combinatorics

      • 680 stránek
      • 24 hodin čtení

      The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem.

      Computing and combinatorics