Copertina

TRAPP: An Efficient Point-to-Point Path Planning Algorithm for Road Networks with Restrictions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Hanzhang, Zhang, Xiangzhi, Gong, Shufeng, Yao, Feng, Yu, Song, Zhang, Yanfeng, Yu, Ge
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Efficient Stochastic Routing in Path-Centric Uncertain Road Networks -- Extended Version
di: Guo, Chenjuan, et al.
Pubblicazione: (2024)

Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks
di: Srikanth, Mithinti, et al.
Pubblicazione: (2024)

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
di: Ashvinkumar, Vikrant, et al.
Pubblicazione: (2025)

Faster Algorithms for Dual-Failure Replacement Paths
di: Chechik, Shiri, et al.
Pubblicazione: (2024)

The Two-Center Problem of Uncertain Points on Trees
di: Xu, Haitao, et al.
Pubblicazione: (2024)

The k-Center Problem of Uncertain Points on Graphs
di: Xu, Haitao, et al.
Pubblicazione: (2025)

Optimized Customizable Route Planning in Large Road Networks with Batch Processing
di: Farhan, Muhammad, et al.
Pubblicazione: (2026)

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
di: Choudhary, Keerti, et al.
Pubblicazione: (2025)

The Two-Center Problem of Uncertain Points on Cactus Graphs
di: Xu, Haitao, et al.
Pubblicazione: (2024)

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

Computing the Center of Uncertain Points on Cactus Graphs
di: Hu, Ran, et al.
Pubblicazione: (2024)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
di: Chen, Kuowen, et al.
Pubblicazione: (2025)

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

Algorithms for Computing Closest Points for Segments
di: Wang, Haitao
Pubblicazione: (2024)

An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest Paths
di: Khanna, Sanjeev, et al.
Pubblicazione: (2026)

MagnifierSketch: Quantile Estimation Centered at One Point
di: Guo, Jiarui, et al.
Pubblicazione: (2025)

Parallel Point-to-Point Shortest Paths and Batch Queries
di: Dong, Xiaojun, et al.
Pubblicazione: (2025)

Obstacle-Free Path Planning for Autonomous Drones Using Floyd Algorithm
di: Yao, Edward
Pubblicazione: (2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
di: Wan, Zongqi, et al.
Pubblicazione: (2024)

Streaming Diameter of High-Dimensional Points
di: Halldórsson, Magnús M., et al.
Pubblicazione: (2025)

DAG Covers: The Steiner Point Effect
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

Sublinear Algorithms for TSP via Path Covers
di: Behnezhad, Soheil, et al.
Pubblicazione: (2023)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
di: Su, Yuexin, et al.
Pubblicazione: (2026)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
di: Kobayashi, Yusuke, et al.
Pubblicazione: (2026)

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
di: Zhang, Guangyi, et al.
Pubblicazione: (2025)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
di: Zhao, Jingyang, et al.
Pubblicazione: (2023)

An Optimal Density Bound for Discretized Point Patrolling
di: Mishra, Ahan
Pubblicazione: (2025)

Path Partitions of Phylogenetic Networks
di: Lafond, Manuel, et al.
Pubblicazione: (2024)

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
di: Liu, Yuxi, et al.
Pubblicazione: (2026)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Faster Approximate Fixed Points of $\ell_\infty$-Contractions
di: Feodorov, Andrei, et al.
Pubblicazione: (2026)

Parameterized Complexity of MinCSP over the Point Algebra
di: Osipov, George, et al.
Pubblicazione: (2023)

Polylogarithmic Approximation for Robust s-t Path
di: Li, Shi, et al.
Pubblicazione: (2023)

Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points
di: Nanniyur, Srihari, et al.
Pubblicazione: (2026)

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
di: Sanaullah, Ahsan, et al.
Pubblicazione: (2025)

Location-Restricted Stable Matching
di: Castro, Garret
Pubblicazione: (2025)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
di: Atalig, Sunny, et al.
Pubblicazione: (2024)

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
di: Song, Zhao, et al.
Pubblicazione: (2022)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
di: Chen, Chi-Yeh
Pubblicazione: (2025)