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

Authors

582

  1. WJ
    Wiro J. Niessen

    Erasmus MC, Netherlands

    6 publications · 262 citations

    6

    h-index

  2. AX
    Alexandre X. Falcão

    Universidade Estadual de Campinas (UNICAMP), Brazil

    5 publications · 280 citations

    5

    h-index

  3. JK
    Jayaram K. Udupa

    University of Pennsylvania, United States

    4 publications · 292 citations

    4

    h-index

  4. PK
    Pankaj K. Agarwal

    Duke University, United States

    4 publications · 77 citations

    4

    h-index

  5. TV
    Theo van Walsum

    Erasmus MC, Netherlands

    3 publications · 130 citations

    3

    h-index

1–5 of 582

Venues

  1. Information Processing Letters

    7 publications · 231 citations

    7

    h-index

  2. Networks

    5 publications · 921 citations

    5

    h-index

  3. 5

    h-index

  4. Algorithmica

    4 publications · 182 citations

    4

    h-index

  5. Computers & Operations Research

    4 publications · 158 citations

    4

    h-index

1–5