Cargando…

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

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 i...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Paschos, Vangelis Th (Editor ), Widmayer, Peter (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2015.
Edición:1st ed. 2015.
Colección:Theoretical Computer Science and General Issues, 9079
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-18173-8
003 DE-He213
005 20230222171630.0
007 cr nn 008mamaa
008 150515s2015 sz | s |||| 0|eng d
020 |a 9783319181738  |9 978-3-319-18173-8 
024 7 |a 10.1007/978-3-319-18173-8  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
245 1 0 |a Algorithms and Complexity  |h [electronic resource] :  |b 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings /  |c edited by Vangelis Th. Paschos, Peter Widmayer. 
250 |a 1st ed. 2015. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2015. 
300 |a XV, 430 p. 81 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9079 
505 0 |a 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. 
520 |a 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. The papers present original research in the theory and applications of algorithms and computational complexity. 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Artificial intelligence-Data processing. 
650 1 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Data Science. 
700 1 |a Paschos, Vangelis Th.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Widmayer, Peter.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319181745 
776 0 8 |i Printed edition:  |z 9783319181721 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9079 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-18173-8  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)