Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Johnson Phosavanh

Johnson Phosavanh

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1Combinatorics×1Optimization and Control×1

Frequent co-authors

Dmytro Matsypura1×

Research Timeline

2026
Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem

This paper introduces the $k$-Step-Central Shortest Path problem to maximize reachability in transportation networks and provides a polynomial-time algorithm for unweighted graphs.

Highlighted terms show continued research focus across papers

Papers

cs.DSmath.COmath.OCTheoreticalRecentJun 12, 2026

Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem

Johnson Phosavanh, Dmytro Matsypura

This paper introduces the $k$-Step-Central Shortest Path problem to maximize reachability in transportation networks and provides a polynomial-time algorithm for unweighted graphs.

View →