| TÃtulo : |
Algorithms and Complexity : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / |
| Tipo de documento: |
documento electrónico |
| Autores: |
Calamoneri, Tiziana, ; Corò, Federico, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2021 |
| Número de páginas: |
XI, 410 p. 33 ilustraciones |
| ISBN/ISSN/DL: |
978-3-030-75242-2 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Idioma : |
Inglés (eng) |
| Palabras clave: |
Algoritmos Gráficos de computadora Informática Sistemas informáticos Inteligencia artificial Diseño y Análisis de Algoritmos Manipulación simbólica y algebraica Implementación de sistema informático |
| Clasificación: |
005.13 |
| Resumen: |
Este libro constituye las actas arbitradas de la 12.ª Conferencia Internacional sobre Algoritmos y Complejidad, CIAC 2019, celebrada como evento virtual en mayo de 2021. Los 28 artÃculos completos presentados junto con una conferencia invitada y dos resúmenes de conferencias invitadas fueron cuidadosamente revisados. y seleccionado entre 78 presentaciones. La Conferencia Internacional sobre Algoritmos y Complejidad tiene como objetivo proporcionar un foro para investigadores que trabajan en todos los aspectos de la complejidad computacional y el uso, diseño, análisis y experimentación de algoritmos y estructuras de datos eficientes. Los artÃculos presentan investigaciones originales en la teorÃa y aplicaciones de algoritmos y complejidad computacional. Debido a la pandemia de Corona, la conferencia se celebró de forma virtual. |
| Nota de contenido: |
Abundant Extensions -- Three Problems on Well-Partitioned Chordal Graphs -- Distributed Distance-r Covering Problems on Sparse High-Girth Graphs -- Reconfiguration of Connected Graph Partitions via Recombination -- Algorithms for Energy Conservation in Heterogeneous Data Centers -- On Vertex-Weighted Graph Realizations -- On the Role of 3's for the 1-2-3 Conjecture -- Upper Tail Analysis of Bucket Sort and Random Tries -- Throughput Scheduling with Equal Additive Laxity -- Fragile Complexity of Adaptive Algorithms -- FPT and Kernelization Algorithms for the Induced Tree Problem -- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs -- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation -- A Multistage View on 2-Satisfiability -- The Weisfeiler-Leman Algorithm and Recognition of Graph Properties -- The Parameterized Suffix Tray -- Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity -- Covering a Set of Line Segments with a Few Squares -- Circumventing Connectivity for Kernelization -- Online and Approximate Network Construction from Bounded Connectivity Constraints -- Globally Rigid Augmentation of Minimally Rigid Graphs in \(R^2\) -- Extending Partial Representations of Rectangular Duals with Given Contact Orientations -- Can Local Optimality be Used for Efficient Data Reduction -- Colouring Graphs of Bounded Diameter in the Absence of Small Cycles -- Online Two-Dimensional Vector Packing with Advice -- Temporal Matching on Geometric Graph Data. |
| Tipo de medio : |
Computadora |
| Summary : |
This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event, in May 2021. The 28 full papers presented together with one invited lecture and 2 two abstracts of invited lectures were carefully reviewed and selected from 78 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity. Due to the Corona pandemic the conference was held virtually. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
Algorithms and Complexity : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / [documento electrónico] / Calamoneri, Tiziana, ; Corò, Federico, . - 1 ed. . - [s.l.] : Springer, 2021 . - XI, 410 p. 33 ilustraciones. ISBN : 978-3-030-75242-2 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés ( eng)
| Palabras clave: |
Algoritmos Gráficos de computadora Informática Sistemas informáticos Inteligencia artificial Diseño y Análisis de Algoritmos Manipulación simbólica y algebraica Implementación de sistema informático |
| Clasificación: |
005.13 |
| Resumen: |
Este libro constituye las actas arbitradas de la 12.ª Conferencia Internacional sobre Algoritmos y Complejidad, CIAC 2019, celebrada como evento virtual en mayo de 2021. Los 28 artÃculos completos presentados junto con una conferencia invitada y dos resúmenes de conferencias invitadas fueron cuidadosamente revisados. y seleccionado entre 78 presentaciones. La Conferencia Internacional sobre Algoritmos y Complejidad tiene como objetivo proporcionar un foro para investigadores que trabajan en todos los aspectos de la complejidad computacional y el uso, diseño, análisis y experimentación de algoritmos y estructuras de datos eficientes. Los artÃculos presentan investigaciones originales en la teorÃa y aplicaciones de algoritmos y complejidad computacional. Debido a la pandemia de Corona, la conferencia se celebró de forma virtual. |
| Nota de contenido: |
Abundant Extensions -- Three Problems on Well-Partitioned Chordal Graphs -- Distributed Distance-r Covering Problems on Sparse High-Girth Graphs -- Reconfiguration of Connected Graph Partitions via Recombination -- Algorithms for Energy Conservation in Heterogeneous Data Centers -- On Vertex-Weighted Graph Realizations -- On the Role of 3's for the 1-2-3 Conjecture -- Upper Tail Analysis of Bucket Sort and Random Tries -- Throughput Scheduling with Equal Additive Laxity -- Fragile Complexity of Adaptive Algorithms -- FPT and Kernelization Algorithms for the Induced Tree Problem -- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs -- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation -- A Multistage View on 2-Satisfiability -- The Weisfeiler-Leman Algorithm and Recognition of Graph Properties -- The Parameterized Suffix Tray -- Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity -- Covering a Set of Line Segments with a Few Squares -- Circumventing Connectivity for Kernelization -- Online and Approximate Network Construction from Bounded Connectivity Constraints -- Globally Rigid Augmentation of Minimally Rigid Graphs in \(R^2\) -- Extending Partial Representations of Rectangular Duals with Given Contact Orientations -- Can Local Optimality be Used for Efficient Data Reduction -- Colouring Graphs of Bounded Diameter in the Absence of Small Cycles -- Online Two-Dimensional Vector Packing with Advice -- Temporal Matching on Geometric Graph Data. |
| Tipo de medio : |
Computadora |
| Summary : |
This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event, in May 2021. The 28 full papers presented together with one invited lecture and 2 two abstracts of invited lectures were carefully reviewed and selected from 78 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity. Due to the Corona pandemic the conference was held virtually. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
|  |
Crear una solicitud de compra Refinar búsqueda
