Algorithms and Complexity
Springer International Publishing (Verlag)
978-3-319-18172-1 (ISBN)
The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.
Peter Widmayer ist als Programm-Manager für mySAP ERP tätig. Er repräsentiert die ERP-Entwicklung im mySAP ERP 2005 Ramp-up und ist zudem programmverantwortlich für die ERP-Mittelstandsinitiative. Davor führte er innerhalb der globalen ERP-Initiative den mySAP ERP 2004 Ramp-up zu weltweitem Erfolg. Seine umfassende SAP-Erfahrung gewann er während der Zeit als Verantwortlicher für den SAP-Produktstandard Globalisierung sowie während der Markteinführung der Unicode-Technologie zur Unterstützung globaler Sprachanforderungen. Als promovierter Experimentalphysiker begann er 1999 bei der SAP AG. Er verbrachte die ersten Jahre als Applikations- und Technologieberater für internationale Konzernkunden.
Communication, Dynamics and Renormalization.- Fast and Powerful Hashing using Tabulation.- Green Barrier Coverage with Mobile Sensors.- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths.- Orthogonal Graph Drawing with In exible Edges.- Linear time Constructions of some d-Restriction Problems.- E ciently Testing T-Interval Connectivity in Dynamic Graphs.- Competitive Strategies for Online Clique Clustering.- Scheduling with Gaps: New Models and Algorithms.- MinMax-Distance Gathering on given Meeting Points.- Evacuating Robots from a Disk Using Face-to-Face Communication.- Planarity of Streamed Graphs.- Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs.- Randomized Adaptive Test Cover.- Contraction Blockers for Graphs with Forbidden Induced Paths.- Label Placement in Road Maps.- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. O ine.- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.- Simple strategies versus optimal schedules in multi-agent patrolling.- Sharing Non-Anonymous Costs of Multiple Resources Optimally.- Algorithms solving the Matching Cut problem.- End-Vertices of Graph Search Algorithms.- Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete.- A Lex-BFS-based recognition algorithm for Robinsonian matrices.- Mixed Map Labeling.- Optimal Online Edge Coloring of Planar Graphs with Advice.- Approximability of Two Variants of Multiple Knapsack.- Block Sorting is Hard.- An opportunistic text indexing structure based on run length encoding.- PSPACE-completeness of Bloxorz and of Games with 2-Buttons.- Advice Complexity of Fine-Grained Job Shop Scheduling.
| Erscheint lt. Verlag | 22.4.2015 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XV, 430 p. 81 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 682 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • algorithmic game theory • approximation algorithms • combinatorial optimization • combinatorics • Computational Complexity • data structures • data structures design and analysis • design and analysis of algorithms • Discrete Mathematics • Geometry and discrete structures • graph theory • Mechanism Design • online algorithms • parameterized complexity and exact algorithms • probabilistic algorithms • probabilistic computation • Quantum Computing • randomness • Streaming models • Sublinear and near linear time algorithms |
| ISBN-10 | 3-319-18172-6 / 3319181726 |
| ISBN-13 | 978-3-319-18172-1 / 9783319181721 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
