SDP-based algorithms for maximum independent set problems on hypergraphs.

Geir Agnarsson Magnús M. Halldórsson Elena Losievskaja

Published in: Theor. Comput. Sci. (2013)

Keyphrases

graph theory
maximum independent set
optimization problems
benchmark problems
combinatorial optimization
semi definite programming
computational complexity
semidefinite programming
partial solutions
data structure
lower bound
search space