Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings de Anna Lubiw

Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12808

Editat de Anna Lubiw, Mohammad Salavatipour, Meng He
en Limba Engleză Paperback – 31 iul 2021
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 63907 lei

Preț vechi: 79884 lei
-20%

Puncte Express: 959
Preț estimativ în valută:
11298€ • 13470$ • 9799£

Carte tipărită la comandă

Livrare economică 16-30 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030835071
ISBN-10: 3030835073
Pagini: 670
Ilustrații: XVI, 670 p. 187 illus., 112 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.95 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.