One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1007/s10878-014-9766-5
Copy DOI
Export
Save
Share
Cite Publication Date: Jul 5, 2014 | |
 Citations: 12 |
Affiliation: Xi'an Jiaotong University
This paper proposes the optimal shortest path set problem in an undirected graph $$G=(V,E)$$ G = ( V , E ) , in which some vehicles have to go from a source node $$s$$ s to a destination node $$t$$...
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
