Research map / Learning theory and algorithms / Combinatorial and search optimization
Real-Time Route Search by Locations
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace direct route matching with query-location network expansion (QLOE) | DRM baseline · BJR and NYR route processing | runtime | Helped |
| add vertex filtering and group expansion (QLOE+) to QLOE (ablation) | QLOE · BJR and NYR route processing | runtime | Helped |
| QLOE+ versus DRM in max arrival rate at 20K queries | DRM · BJR | routes/h: 83 -> 15K | Helped |
| increase similarity threshold theta from 0.80 to 0.95 | QLOE+ · BJR and NYR | runtime | Helped |
| increase similarity threshold theta from 0.80 to 0.95 | DRM and QLOE · BJR and NYR | runtime | No clear effect |
| increase number of locations per query from 3 to 7 | all methods · BJR and NYR | runtime | Hurt |
| extend to top-k C-RSL instead of threshold | QLOE+ · BJR and NYR | runtime: increased by factors of 2.5-4.0 | Hurt |
| increase k from 5 to 30 | QLOE and QLOE+ · top-k C-RSL | runtime: ~1.2 and ~1.4 factor | Hurt |
| increase number of queries from 20K to 100K | all methods · BJR and NYR | runtime | Hurt |
| increase thread count from 16 to 48 | QLOE+ vs baselines · BJR and NYR | runtime | No clear effect |
Closest papers by meaning
- When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing (AAAI 2021 · similarity 0.84)
- Semantic Routing via Autoregressive Modeling (NeurIPS 2024 · similarity 0.81)
- TransitLM: A Large-Scale Dataset and Benchmark for Map-Free Transit Route Generation (NeurIPS 2026 · similarity 0.80)
- Resource Constrained Pathfinding with Enhanced Bidirectional A* Search (AAAI 2025 · similarity 0.79)
- Improving IP Geolocation With Target-Centric IP Graph (Student Abstract) (AAAI 2024 · similarity 0.79)
- CSPG: Crossing Sparse Proximity Graphs for Approximate Nearest Neighbor Search (NeurIPS 2024 · similarity 0.78)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.