Using well-solvable minimum cost exact covering for VLSI clock energy minimization.
Shmuel WimerDoron GluzerUri WimerPublished in: Oper. Res. Lett. (2014)
Keyphrases
- minimum cost
- energy minimization
- np hard
- graph cuts
- energy function
- approximation algorithms
- special case
- markov random field
- np complete
- network flow
- global minimum
- network flow problem
- image segmentation
- spanning tree
- problems in computer vision
- global minimization
- integer programming
- linear programming
- max flow
- max flow min cut
- low level vision
- optimal solution
- worst case
- lower bound
- branch and bound algorithm
- undirected graph
- knapsack problem
- early vision
- constraint satisfaction problems
- higher order
- computational complexity
- min cut