Free shipping on orders over $99
Algorithms and Complexity

Algorithms and Complexity

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

by Peter Widmayer and Vangelis Th. Paschos
Paperback
Publication Date: 31/05/2015

Share This Book:

  $84.99
or 4 easy payments of $21.25 with
afterpay

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 Inflexible Edges.- Linear time Constructions of some d-Restriction Problems.- Efficiently 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. Offline.- 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.

ISBN:
9783319181721
9783319181721
Category:
Database design & theory
Format:
Paperback
Publication Date:
31-05-2015
Language:
English
Publisher:
Springer
Country of origin:
United States
Dimensions (mm):
235x155mm
Weight:
0.68kg

This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 2 - 3 weeks of you placing an order.

Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.

Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:

ACT Metro: 2 working days
NSW Metro: 2 working days
NSW Rural: 2-3 working days
NSW Remote: 2-5 working days
NT Metro: 3-6 working days
NT Remote: 4-10 working days
QLD Metro: 2-4 working days
QLD Rural: 2-5 working days
QLD Remote: 2-7 working days
SA Metro: 2-5 working days
SA Rural: 3-6 working days
SA Remote: 3-7 working days
TAS Metro: 3-6 working days
TAS Rural: 3-6 working days
VIC Metro: 2-3 working days
VIC Rural: 2-4 working days
VIC Remote: 2-5 working days
WA Metro: 3-6 working days
WA Rural: 4-8 working days
WA Remote: 4-12 working days

Reviews

Be the first to review Algorithms and Complexity.