Información del autor
Autor Peis, Britta |
Documentos disponibles escritos por este autor (1)
Crear una solicitud de compra Refinar búsqueda
TÃtulo : Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / Tipo de documento: documento electrónico Autores: Koenemann, Jochen, ; Peis, Britta, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2021 Número de páginas: XII, 275 p. 24 ilustraciones, 12 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-92702-8 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: Matemáticas Matemática Computacional y Análisis Numérico Clasificación: 518 Resumen: Este libro constituye las actas posteriores al taller, exhaustivamente arbitrado, del 19.º Taller internacional sobre aproximación y algoritmos en lÃnea, WAOA 2021, celebrado en septiembre de 2021. Debido a la pandemia de COVID-19, la conferencia se llevó a cabo de forma virtual. Los 16 artÃculos completos revisados ​​presentados en este libro fueron cuidadosamente revisados ​​y seleccionados entre 31 presentaciones. Los artÃculos se centran en el diseño y análisis de algoritmos para problemas en lÃnea y computacionalmente difÃciles. Nota de contenido: How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.-An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation. Tipo de medio : Computadora Summary : This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / [documento electrónico] / Koenemann, Jochen, ; Peis, Britta, . - 1 ed. . - [s.l.] : Springer, 2021 . - XII, 275 p. 24 ilustraciones, 12 ilustraciones en color.
ISBN : 978-3-030-92702-8
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: Matemáticas Matemática Computacional y Análisis Numérico Clasificación: 518 Resumen: Este libro constituye las actas posteriores al taller, exhaustivamente arbitrado, del 19.º Taller internacional sobre aproximación y algoritmos en lÃnea, WAOA 2021, celebrado en septiembre de 2021. Debido a la pandemia de COVID-19, la conferencia se llevó a cabo de forma virtual. Los 16 artÃculos completos revisados ​​presentados en este libro fueron cuidadosamente revisados ​​y seleccionados entre 31 presentaciones. Los artÃculos se centran en el diseño y análisis de algoritmos para problemas en lÃnea y computacionalmente difÃciles. Nota de contenido: How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.-An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation. Tipo de medio : Computadora Summary : This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]