Articoli correlati a Algorithms and Complexity: 9th International Conference,...

Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings - Brossura

 
9783319181745: Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings

Al momento non sono disponibili copie per questo codice ISBN.

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

  • EditoreSpringer
  • Data di pubblicazione2015
  • ISBN 10 3319181742
  • ISBN 13 9783319181745
  • RilegaturaPaperback
  • LinguaInglese
  • Contatto del produttorenon disponibile

(nessuna copia disponibile)

Cerca:



Inserisci un desiderata

Non riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!

Inserisci un desiderata

Altre edizioni note dello stesso titolo

9783319181721: Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings: 9079

Edizione in evidenza

ISBN 10:  3319181726 ISBN 13:  9783319181721
Casa editrice: Springer, 2015
Brossura