Holiest Minimum-Cost Paths and Flows in Surface Graphs.
Jeff EricksonKyle FoxLuvsandondov LkhamsurenPublished in: CoRR (2018)
Keyphrases
- minimum cost
- spanning tree
- undirected graph
- np hard
- approximation algorithms
- network flow
- network flow problem
- minimum cost path
- capacity constraints
- minimal paths
- network simplex algorithm
- minimum cost flow
- minimal surface
- edit operations
- weighted graph
- shortest path
- graph databases
- graph mining
- graph partitioning
- graph theoretic
- directed graph
- scheduling problem
- graph matching
- branch and bound algorithm
- linear programming
- dynamic programming