E-Book, Englisch, Band 7434, 606 Seiten, eBook
18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings
E-Book, Englisch, Band 7434, 606 Seiten, eBook
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-642-32241-9
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
Zielgruppe
Professional/practitioner
Autoren/Hrsg.
Weitere Infos & Material
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.- A Simple
D
2-Sampling Based PTAS for
k
-Means and other Clustering Problems.- Speed Scaling for Maximum Lateness.- Induced Subgraph Isomorphism: Are Some Patterns Substantially.- Easier Than Others.- Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs.- Online Knapsack Problem with Removal Cost.- An Improved Exact Algorithm for TSP in Degree-4 Graphs.- Dynamic Programming for
H
-minor-free Graphs.- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals.- An Improved Algorithm for Packing
T
-Paths in Inner Eulerian Networks.- Towards Optimal and Expressive Kernelization for
d
-Hitting Set.-Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs.- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs.- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property.- Rainbow Colouring of Split and Threshold.- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Succinct Representations of Binary Trees for Range Minimum Queries.