Theoretical Computer Science and General Issues

Computing and Combinatorics

17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings

Editors: Fu, Bin, Du, Ding-Zhu (Eds.)

  • <p>Up-to-date results </p><p>Fast-track conference proceedings </p><p>State-of-the-art research</p>

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-642-22685-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-3-642-22684-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the refereed proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.

Table of contents (55 chapters)

  • Derandomizing HSSW Algorithm for 3-SAT

    Makino, Kazuhisa (et al.)

    Pages 1-12

  • Dominating Set Counting in Graph Classes

    Kijima, Shuji (et al.)

    Pages 13-24

  • The Density Maximization Problem in Graphs

    Kao, Mong-Jen (et al.)

    Pages 25-36

  • FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time

    Brinkmeyer, Malte (et al.)

    Pages 37-48

  • Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems

    Zhu, Daming (et al.)

    Pages 49-61

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-642-22685-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-3-642-22684-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Computing and Combinatorics
Book Subtitle
17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings
Editors
  • Bin Fu
  • Ding-Zhu Du
Series Title
Theoretical Computer Science and General Issues
Series Volume
6842
Copyright
2011
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Berlin Heidelberg
eBook ISBN
978-3-642-22685-4
DOI
10.1007/978-3-642-22685-4
Softcover ISBN
978-3-642-22684-7
Edition Number
1
Number of Pages
XIII, 650
Number of Illustrations and Tables
102 b/w illustrations, 5 illustrations in colour
Topics