Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture.

Alina Ene Jan Vondrák

Published in: APPROX-RANDOM (2014)

Keyphrases

neural network
greedy algorithm
shape matching
phase transition
linear programming
pattern matching
matching algorithm
information theoretic
simplex algorithm
graph matching
database
computational complexity
high order
graph cuts
energy minimization
worst case
data mining
matching process
feature matching
real time