Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor.

Costas Busch Ryan LaFortune Srikanta Tirthapura

Published in: Algorithmica (2014)

Keyphrases

planar graphs
max cut
high dimensional
undirected graph
minimum weight
approximate inference
probabilistic model
linear program
pairwise
shortest path
weighted graph