Computing and Combinatorics
Springer Berlin (Verlag)
978-3-642-32240-2 (ISBN)
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.
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.- A Simple D2-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.
| Erscheint lt. Verlag | 3.7.2012 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIV, 606 p. 116 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 937 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • Approximation • data structure • one-way function • pseudorandom generator • Traveling Salesman Problem |
| ISBN-10 | 3-642-32240-9 / 3642322409 |
| ISBN-13 | 978-3-642-32240-2 / 9783642322402 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
