Imagen de Portada

Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ahrens, Markus, Henke, Dorothee, Rabenstein, Stefan, Vygen, Jens
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Shortest Paths on Convex Polyhedral Surfaces
por: Wang, Haitao
Publicado: (2025)

Shortest Path Separators in Unit Disk Graphs
por: Harb, Elfarouk, et al.
Publicado: (2024)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2025)

Single-Source Shortest Path Problem in Weighted Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
por: de Berg, Sarita, et al.
Publicado: (2023)

Better approximation guarantee for Asymmetric TSP
por: Vygen, Jens
Publicado: (2026)

On Incremental Approximate Shortest Paths in Directed Graphs
por: Górkiewicz, Adam, et al.
Publicado: (2025)

Even Faster Algorithm for the Chamfer Distance
por: Feng, Ying, et al.
Publicado: (2025)

Faster Approximation Scheme for Euclidean $k$-TSP
por: van Wijland, Ernest, et al.
Publicado: (2023)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Faster exponential algorithms for cut problems via geometric data structures
por: Kozma, László, et al.
Publicado: (2025)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
por: Iacono, John, et al.
Publicado: (2025)

On the Complexity of the Bilevel Shortest Path Problem
por: Henke, Dorothee, et al.
Publicado: (2024)

Hierarchical Multicriteria Shortest Path Search
por: Kurbanov, Temirlan, et al.
Publicado: (2025)

The Robust Bilevel Selection Problem
por: Henke, Dorothee
Publicado: (2024)

Local Routing on Ordered $Θ$-graphs
por: van Renssen, André, et al.
Publicado: (2025)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
por: Li, Jason, et al.
Publicado: (2025)

Uncrossed Multiflows and Applications to Disjoint Paths
por: Chekuri, Chandra, et al.
Publicado: (2025)

Dynamic Convex Hulls for Simple Paths
por: Brewer, Bruce, et al.
Publicado: (2024)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
por: Blauth, Jannis, et al.
Publicado: (2022)

Continuous Map Matching to Paths under Travel Time Constraints
por: Bosch, Yannick, et al.
Publicado: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
por: Marin, Malory, et al.
Publicado: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
por: Eppstein, David
Publicado: (2023)

Retroactive Monotonic Priority Queues via Range Searching
por: Castro, Lucas, et al.
Publicado: (2025)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Incremental Approximate Single-Source Shortest Paths with Predictions
por: McCauley, Samuel, et al.
Publicado: (2025)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
por: P V, Althaf, et al.
Publicado: (2026)

Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method
por: Liu, Yang P.
Publicado: (2025)

Faster Algorithms for Shortest Unique or Absent Substrings
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2026)

The Discrepancy of Shortest Paths
por: Bodwin, Greg, et al.
Publicado: (2024)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
por: Krauthgamer, Robert, et al.
Publicado: (2026)

On Constrained and k Shortest Paths
por: Bendahi, Abderrahim, et al.
Publicado: (2024)

Shortest Paths in Multimode Graphs
por: Kirkpatrick, Yael, et al.
Publicado: (2025)

All-Hops Shortest Paths
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

Parameterized Shortest Path Reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2024)

A Faster Directed Single-Source Shortest Path Algorithm
por: Duan, Ran, et al.
Publicado: (2026)

The Steiner Shortest Path Tree Problem
por: Asher, Omer, et al.
Publicado: (2025)