Algorithms and Complexity

9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings

Häftad, Engelska, 2015

Av Vangelis Th. Paschos, Peter Widmayer, Vangelis Th Paschos

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers.

Produktinformation

Utgivningsdatum2015-04-22
Mått155 x 235 x 25 mm
Vikt674 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor430
FörlagSpringer International Publishing AG
ISBN9783319181721

Tillhör följande kategorier

Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och it
Systemvetenskap och AI inom Data och it

Communication, Dynamics and Renormalization.- Fast and Powerful Hashing using Tabulation.- Green Barrier Coverage with Mobile Sensors.- A Reﬁned 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 Deﬁned 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.