A new research paper explores the computational complexity of bus routing problems, particularly how different agent models and their walking cost objectives influence the difficulty of finding optimal routes. The study finds that even simple agent cost models lead to hardness on general networks and that agent-specific cost models can cause hardness even on simple tree structures. However, consistent agent models and the choice between bus and direct walking can alter the problem's complexity. AI
IMPACT This research contributes to understanding the complexity of multi-agent systems, relevant for optimizing AI-driven logistics and routing.
RANK_REASON The cluster contains a single academic paper on arXiv discussing computational complexity. [lever_c_demoted from research: ic=1 ai=0.7]
Read on arXiv cs.MA (Multiagent) →
- alphaXiv
- arXiv
- CatalyzeX
- DagsHub
- Gotit.pub
- Hugging Face
- Influence Flower
- Luca Pascal Staus
- ScienceCast
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
