arXiv (OAI Expanded)
open access
Dynamics-preserving network reductions for ride-pooling paths
Reducing the complexity of ride-pooling paths is a central challenge in systems with distributed demand. Here we show that such dynamics admit an exact coarse-grained representation: for a broad class of routing algorithms whose decisions depend only on path lengths, the full network can be reduced
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- When Edge Importance Disagrees: Resistance-Ranked versus Betweenness Pruning on Urban Road Networks#1077468
- A model-based heuristic to the min max K-arc routing for connectivity problem#954456
- Shortest Two Disjoint Paths in Polynomial Time#178011
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#622493
- Ride-sharing simulation for optimisation / Bernhard Johannes Berger, Christina Plump, Rolf Drechsler#922043
Record · ID 1070091
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive