LP-branching algorithms based on biased graphs.

Magnus Wahlström

Published in: SODA (2017)

Keyphrases

computationally efficient
graph theory
linear programming
data sets
learning algorithm
significant improvement
theoretical analysis
times faster
bayesian networks
optimal solution
machine learning algorithms
benchmark datasets
directed graph
interior point