Minimum-cost Path Computation
Minimum-Cost Path Computation is a computational method within graph theory that determines the path between nodes in a weighted graph such that the sum of the edge weights along the path is minimized, distinguishing it from other pathfinding techniques by its optimization objective of achieving the lowest cumulative cost.
229
Publications
24.4K
Citations
582
Authors
263
Institutions
Publications per year
2017–2026
38
Variants
Minimum Cost Path Computation
Parents
229
The focussed D* algorithm for real-time replanning
Anthony Stentz · 1995 · 820 citations
A quick method for finding shortest pairs of disjoint paths
J. W. Suurballe, Robert E. Tarjan · Networks · 1984 · 693 citations
A scalable solution to minimum cost forwarding in large sensor networks
Fan Ye, Andre Chen, Songwu Lu et al. · 2002 · 413 citations
A strongly polynomial minimum cost circulation algorithm
Éva Tardos · COMBINATORICA · 1985 · 378 citations
1–5 of 229
582
6
h-index
Universidade Estadual de Campinas (UNICAMP), Brazil
5 publications · 280 citations
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 582
263
University of Pennsylvania
Philadelphia, United States
8 h-index
9 publications
570 citations
Duke University
Durham, United States
6 h-index
9 publications
212 citations

University of Coimbra
Coimbra, Portugal
5 h-index
9 publications
189 citations

Delft University of Technology
Delft, The Netherlands
5 h-index
10 publications
635 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
9 publications
916 citations
Seoul National University
Seoul, South Korea
4 h-index
7 publications
239 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
4 h-index
13 publications
525 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
4 h-index
8 publications
444 citations
1–8 of 263
7 publications · 231 citations
7
h-index
5 publications · 921 citations
5
h-index
5 publications · 416 citations
5
h-index
4 publications · 182 citations
4
h-index
4 publications · 158 citations
4
h-index
1–5