Approximating Minimum-Cost Connected T-Joins.

Joseph Cheriyan Zachary Friggstad Zhihan Gao

Published in: Algorithmica (2015)

Keyphrases

minimum cost
np hard
approximation algorithms
network flow
network flow problem
spanning tree
capacity constraints
query optimization
network simplex algorithm
undirected graph
query evaluation
join algorithms
minimum cost flow
connected components
special case
np complete
linear programming
search algorithm