| TÃtulo : |
Combinatorial Algorithms : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / |
| Tipo de documento: |
documento electrónico |
| Autores: |
GÄ…sieniec, Leszek, ; Klasing, Ralf, ; Radzik, Tomasz, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2020 |
| Número de páginas: |
XIX, 424 p. 120 ilustraciones, 29 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-48966-3 |
| 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: |
Informática Matemáticas discretas Inteligencia artificial Software de la aplicacion Red de computadoras Gráficos de computadora Algoritmos Matemáticas discretas en informática Ciencia de los datos Aplicaciones informáticas y de sistemas de información Redes de comunicación informática |
| Clasificación: |
40.151 |
| Resumen: |
Este libro constituye las actas del 31º Taller Internacional sobre Algoritmos Combinatorios que estaba previsto que se llevara a cabo en Burdeos, Francia, del 8 al 10 de junio de 2020. Debido a la pandemia de COVID-19, la conferencia cambió a un formato virtual. Los 30 artÃculos completos incluidos en este libro fueron cuidadosamente revisados ​​y seleccionados entre 62 envÃos. Se centran en el diseño de algoritmos para una gran variedad de problemas combinatorios que subyacen a las aplicaciones informáticas en ciencia, ingenierÃa y negocios. |
| Nota de contenido: |
Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. |
| Tipo de medio : |
Computadora |
| Summary : |
This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
Combinatorial Algorithms : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / [documento electrónico] / GÄ…sieniec, Leszek, ; Klasing, Ralf, ; Radzik, Tomasz, . - 1 ed. . - [s.l.] : Springer, 2020 . - XIX, 424 p. 120 ilustraciones, 29 ilustraciones en color. ISBN : 978-3-030-48966-3 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: |
Informática Matemáticas discretas Inteligencia artificial Software de la aplicacion Red de computadoras Gráficos de computadora Algoritmos Matemáticas discretas en informática Ciencia de los datos Aplicaciones informáticas y de sistemas de información Redes de comunicación informática |
| Clasificación: |
40.151 |
| Resumen: |
Este libro constituye las actas del 31º Taller Internacional sobre Algoritmos Combinatorios que estaba previsto que se llevara a cabo en Burdeos, Francia, del 8 al 10 de junio de 2020. Debido a la pandemia de COVID-19, la conferencia cambió a un formato virtual. Los 30 artÃculos completos incluidos en este libro fueron cuidadosamente revisados ​​y seleccionados entre 62 envÃos. Se centran en el diseño de algoritmos para una gran variedad de problemas combinatorios que subyacen a las aplicaciones informáticas en ciencia, ingenierÃa y negocios. |
| Nota de contenido: |
Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. |
| Tipo de medio : |
Computadora |
| Summary : |
This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
|  |
Crear una solicitud de compra Refinar búsqueda
