Image de couverture de livre

Local Routing on Ordered $Θ$-graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	van Renssen, André, Sakaguchi, Shuei
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Spanner for the $0/1/\infty$ weighted region problem
par: Gudmundsson, Joachim, et autres
Publié: (2024)

The Contiguous Art Gallery Problem is in Θ(n log n)
par: de Berg, Sarita, et autres
Publié: (2025)

Dynamic Locality Sensitive Orderings in Doubling Metrics
par: La, An, et autres
Publié: (2024)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
par: Ahrens, Markus, et autres
Publié: (2021)

Finding maximum matchings in RDV graphs efficiently
par: Biedl, Therese, et autres
Publié: (2024)

Dynamic parameterized problems on unit disk graphs
par: An, Shinwoo, et autres
Publié: (2024)

A face cover perspective to $\ell_1$ embeddings of planar graphs
par: Filtser, Arnold
Publié: (2019)

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
par: Berthe, Gaétan, et autres
Publié: (2023)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
par: Duan, Hongyi, et autres
Publié: (2025)

Faster Approximation Scheme for Euclidean $k$-TSP
par: van Wijland, Ernest, et autres
Publié: (2023)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

On computing the (exact) Fréchet distance with a frog
par: Conradi, Jacobus, et autres
Publié: (2025)

The Complexity of Geodesic Spanners
par: de Berg, Sarita, et autres
Publié: (2023)

Engineering Fully Dynamic Convex Hulls
par: van der Hoog, Ivor, et autres
Publié: (2026)

Data Structures for Approximate Discrete Fréchet Distance
par: van der Hoog, Ivor, et autres
Publié: (2022)

Efficient Greedy Discrete Subtrajectory Clustering
par: van der Hoog, Ivor, et autres
Publié: (2025)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
par: Conradi, Jacobus, et autres
Publié: (2026)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
par: de Berg, Sarita, et autres
Publié: (2026)

A Task-Parallel Approach for Localized Topological Data Structures
par: Liu, Guoxi, et autres
Publié: (2023)

Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering
par: Manthey, Bodo, et autres
Publié: (2023)

Obstacle-Aware Length-Matching Routing for Any-Direction Traces in Printed Circuit Board
par: Fang, Weijie, et autres
Publié: (2024)

Internal versus external balancing in the evaluation of graph-based number types
par: Geppert, Hanna, et autres
Publié: (2019)

Light Spanners with Small Hop-Diameter
par: Bhore, Sujoy, et autres
Publié: (2025)

Faster exponential algorithms for cut problems via geometric data structures
par: Kozma, László, et autres
Publié: (2025)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
par: Depian, Thomas, et autres
Publié: (2025)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
par: Gusain, Rachana, et autres
Publié: (2025)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
par: Banik, Aritra, et autres
Publié: (2025)

The Peculiarities of Extending Queue Layouts
par: Depian, Thomas, et autres
Publié: (2025)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
par: Chan, Timothy M., et autres
Publié: (2025)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
par: Ghaseminia, Benyamin, et autres
Publié: (2025)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
par: Kar, Debajyoti, et autres
Publié: (2025)

Single-Source Shortest Path Problem in Weighted Disk Graphs
par: An, Shinwoo, et autres
Publié: (2025)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
par: Iacono, John, et autres
Publié: (2025)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)