| Título : |
17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Lubiw, Anna, ; Salavatipour, Mohammad, ; He, Meng, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2021 |
| Número de páginas: |
XVI, 670 p. 187 ilustraciones, 112 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-83508-8 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Estructuras de datos (Informática) Teoría de la información Algoritmos Ingeniería Informática Red de computadoras Informática Matemáticas discretas Gráficos de computadora Estructuras de datos y teoría de la información Diseño y Análisis de Algoritmos Ingeniería Informática y Redes Manipulación simbólica y algebraica Matemáticas discretas en informática |
| Índice Dewey: |
005.73 Estructuras de datos |
| Resumen: |
Este libro constituye las actas arbitradas del 17º Simposio Internacional sobre Algoritmos y Estructuras de Datos, WADS 2021, celebrado virtualmente en agosto de 2021. Los 47 artículos completos, presentados junto con dos conferencias invitadas, fueron cuidadosamente revisados y seleccionados de un total de 123 presentaciones. . Presentan investigaciones originales sobre la teoría, diseño y aplicación de algoritmos y estructuras de datos. |
| Nota de contenido: |
Adjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed Ѳ6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical Parallel Machines -- Online Makespan Minimization With Budgeted Uncertainty -- Pattern Matching in Doubling Spaces -- Reachability Problems for Transmission Graphs -- On Minimum Generalized Manhattan Connections -- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields -- Generalized Disk Graphs -- A 4-Approximation of the 2π/3 -MST -- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations -- The Neighborhood Polynomial of Chordal -- Incomplete Directed Perfect Phylogeny in Linear Time -- Euclidean maximum matchings in the plane—local to global -- Solving Problems on Generalized Convex Graphs via Mim-Width -- Improved Bounds on the Spanning Ratio of the Theta-5 Graph -- Computing Weighted Subset Transversals in H-Free Graphs -- Computing the Fréchet Distance Between Uncertain Curves in One Dimension -- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time -- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees -- An APTAS for Bin Packing with Clique-graph Conflicts -- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs -- ANN for time series under the Fréchet distance -- Strictly In-Place Algorithms for Permuting and Inverting -- A Stronger Lower Bound on Parametric Minimum Spanning Trees -- Online bin packing of squares and cubes -- Exploration of k-Edge-Deficient Temporal Graphs -- Parameterized Complexity of Categorical Clustering with Size Constraints -- Graph Pricing With Limited Supply -- Fair Correlation Clustering with Global and Local Guarantees -- Better Distance Labeling for Unweighted Planar Graphs -- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths -- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space -- Upper and Lower Bounds for Fully Retroactive Graph Problem -- Characterization of Super-stable Matching -- Uniform Embeddings for Robinson Similarity Matrices -- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs -- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs -- Support Optimality and Adaptive Cuckoo Filters -- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time -- Algorithms for the Line-Constrained Disk Coverage and Related Problems -- A universal cycle for strings with fixed-content (which are also known as multiset permutations) -- Routing on Heavy-Path WSPD-Spanners -- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance -- Diverse Partitions of Colored Points -- Reverse Shortest Path Problem for Unit-Disk Graphs. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings [documento electrónico] / Lubiw, Anna, ; Salavatipour, Mohammad, ; He, Meng, . - 1 ed. . - [s.l.] : Springer, 2021 . - XVI, 670 p. 187 ilustraciones, 112 ilustraciones en color. ISBN : 978-3-030-83508-8 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Estructuras de datos (Informática) Teoría de la información Algoritmos Ingeniería Informática Red de computadoras Informática Matemáticas discretas Gráficos de computadora Estructuras de datos y teoría de la información Diseño y Análisis de Algoritmos Ingeniería Informática y Redes Manipulación simbólica y algebraica Matemáticas discretas en informática |
| Índice Dewey: |
005.73 Estructuras de datos |
| Resumen: |
Este libro constituye las actas arbitradas del 17º Simposio Internacional sobre Algoritmos y Estructuras de Datos, WADS 2021, celebrado virtualmente en agosto de 2021. Los 47 artículos completos, presentados junto con dos conferencias invitadas, fueron cuidadosamente revisados y seleccionados de un total de 123 presentaciones. . Presentan investigaciones originales sobre la teoría, diseño y aplicación de algoritmos y estructuras de datos. |
| Nota de contenido: |
Adjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed Ѳ6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical Parallel Machines -- Online Makespan Minimization With Budgeted Uncertainty -- Pattern Matching in Doubling Spaces -- Reachability Problems for Transmission Graphs -- On Minimum Generalized Manhattan Connections -- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields -- Generalized Disk Graphs -- A 4-Approximation of the 2π/3 -MST -- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations -- The Neighborhood Polynomial of Chordal -- Incomplete Directed Perfect Phylogeny in Linear Time -- Euclidean maximum matchings in the plane—local to global -- Solving Problems on Generalized Convex Graphs via Mim-Width -- Improved Bounds on the Spanning Ratio of the Theta-5 Graph -- Computing Weighted Subset Transversals in H-Free Graphs -- Computing the Fréchet Distance Between Uncertain Curves in One Dimension -- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time -- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees -- An APTAS for Bin Packing with Clique-graph Conflicts -- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs -- ANN for time series under the Fréchet distance -- Strictly In-Place Algorithms for Permuting and Inverting -- A Stronger Lower Bound on Parametric Minimum Spanning Trees -- Online bin packing of squares and cubes -- Exploration of k-Edge-Deficient Temporal Graphs -- Parameterized Complexity of Categorical Clustering with Size Constraints -- Graph Pricing With Limited Supply -- Fair Correlation Clustering with Global and Local Guarantees -- Better Distance Labeling for Unweighted Planar Graphs -- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths -- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space -- Upper and Lower Bounds for Fully Retroactive Graph Problem -- Characterization of Super-stable Matching -- Uniform Embeddings for Robinson Similarity Matrices -- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs -- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs -- Support Optimality and Adaptive Cuckoo Filters -- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time -- Algorithms for the Line-Constrained Disk Coverage and Related Problems -- A universal cycle for strings with fixed-content (which are also known as multiset permutations) -- Routing on Heavy-Path WSPD-Spanners -- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance -- Diverse Partitions of Colored Points -- Reverse Shortest Path Problem for Unit-Disk Graphs. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
Hacer una sugerencia Refinar búsqueda17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings / Lubiw, Anna ; Salavatipour, Mohammad ; He, Meng
