Research map / Learning theory and algorithms / Combinatorial and search optimization
Adaptive Probing Policies for Shortest Path Routing
Aditya Bhaskara, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| lower failure probability delta* from 0.1 to 0.01 (ablation) | GREEDY · NYC taxi data, 1,000 queries | optimal path found: 966 -> 1, 000 | Improved |
| lower delta* from 0.1 to 0.01 (ablation) | GREEDY · 10 alternates | average number of probes: 1.75 -> 2.42 | Hurt |
| lower delta* from 0.1 to 0.01 (ablation) | GREEDY · 20 alternates | average number of probes: 2.43 -> 3.67 | Hurt |
| lower delta* from 0.1 to 0.01 (ablation) | GREEDY · 30 alternates | average number of probes: 2.95 -> 5.03 | Hurt |
| lower delta* from 0.1 to 0.01 (ablation) | GREEDY · 40 alternates | average number of probes: 4.02 -> 9.54 | Hurt |
| increase number of alternate paths from 10 to 40 (ablation) | GREEDY (delta*=0.01) · NYC taxi data | average number of probes: 2.42 -> 9.54 | Hurt |
| increase number of alternate paths from 10 to 40 (ablation) | GREEDY (delta*=0.1) · NYC taxi data | average number of probes: 1.75 -> 4.02 | Hurt |
| use GREEDY probing instead of Dijkstra on historical averages | shortest path routing · NYC taxi data | optimal path found: 565 -> 966 | Improved |
| vary canonical path length and path overlap (ablation) | correlation between non-canonical paths · NYC taxi data | absolute Pearson correlation: 0.11 | No clear effect |
Closest papers by meaning
- Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks (AAAI 2025 · similarity 0.85)
- Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths (AAAI 2024 · similarity 0.85)
- Limited Query Graph Connectivity Test (AAAI 2024 · similarity 0.84)
- Semantic Routing via Autoregressive Modeling (NeurIPS 2024 · similarity 0.83)
- Solving Multiagent Path Finding on Highly Centralized Networks (AAAI 2025 · similarity 0.83)
- Approximate Distance Oracle for Fault-Tolerant Geometric Spanners (AAAI 2024 · similarity 0.83)
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.
