On the computational complexity of minimum-concave-cost flow in a two-dimensional grid.
Shabbir AhmedQie HeShi LiGeorge L. NemhauserPublished in: CoRR (2016)
Keyphrases
- computational complexity
- minimum cost
- three dimensional
- storage requirements
- special case
- multi dimensional
- total cost
- np hard
- square grid
- objective function
- low complexity
- np complete
- computational efficiency
- hexagonal grid
- high cost
- network flow problem
- cost reduction
- minimum total cost
- convexity properties
- grid structure
- cost savings
- minimal cost
- spanning tree
- piecewise linear
- motion estimation
- lower bound