Pattern matching in doubling spaces

DOI10.1007/978-3-030-83508-8_5OpenAlexW3196017606MaRDI QIDQ832835

Antoine Vigneron, Corentin Allair

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2012.10919

zbMATH Keywords

pattern matchingapproximation algorithmsdoubling spaces

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric pattern matching under Euclidean motion
• Congruence, similarity, and symmetries of geometric objects
• Searching dynamic point sets in spaces with bounded doubling dimension
• New Doubling Spanners: Better and Simpler
• Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
• Bypassing the embedding
• Low Distortion Maps Between Point Sets
• Hardness of Embedding Metric Spaces of Equal Size
• Distortion Is Fixed Parameter Tractable
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics
• Tight Lower Bounds on Graph Embedding Problems
• Metric Spaces with Expensive Distances
• Greedy spanners are optimal in doubling metrics
• A PTAS for the Steiner Forest Problem in Doubling Metrics
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Parameterized Algorithms

This page was built for publication: Pattern matching in doubling spaces