Theoretical Computer Science and General Issues

Computing and Combinatorics

18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings

Editors: Gudmundsson, Joachim, Mestre, Julián, Viglas, Taso (Eds.)

Free Preview
  • Up-to-date results
  • State-of-the-art research
  • Fast-track conference proceedings
see more benefits

Buy this book

eBook $89.00
price for USA in USD (gross)
  • ISBN 978-3-642-32241-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $119.00
price for USA in USD
  • ISBN 978-3-642-32240-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012.
The 50 revised full papers presented were carefully reviewed and selected from 121 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.

Table of contents (49 chapters)

Table of contents (49 chapters)
  • A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree

    Bhattacharya, Binay (et al.)

    Pages 1-12

  • A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems

    Jaiswal, Ragesh (et al.)

    Pages 13-24

  • Speed Scaling for Maximum Lateness

    Bampis, Evripidis (et al.)

    Pages 25-36

  • Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?

    Floderus, Peter (et al.)

    Pages 37-48

  • Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs

    Bezáková, Ivona (et al.)

    Pages 49-60

Buy this book

eBook $89.00
price for USA in USD (gross)
  • ISBN 978-3-642-32241-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $119.00
price for USA in USD
  • ISBN 978-3-642-32240-2
  • 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
18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings
Editors
  • Joachim Gudmundsson
  • Julián Mestre
  • Taso Viglas
Series Title
Theoretical Computer Science and General Issues
Series Volume
7434
Copyright
2012
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-32241-9
DOI
10.1007/978-3-642-32241-9
Softcover ISBN
978-3-642-32240-2
Edition Number
1
Number of Pages
XIV, 606
Number of Illustrations
116 b/w illustrations
Topics