Holiest minimum-cost paths and flows in surface graphs.
Jeff EricksonKyle FoxLuvsandondov LkhamsurenPublished in: STOC (2018)
Keyphrases
- minimum cost
- spanning tree
- undirected graph
- approximation algorithms
- np hard
- network flow
- network flow problem
- minimum cost path
- minimal paths
- capacity constraints
- minimum cost flow
- edit operations
- network simplex algorithm
- minimal surface
- graph theoretic
- directed graph
- graph matching
- graph mining
- shortest path
- search algorithm