Approximating Minimum-Cost Connected T-Joins.

Joseph Cheriyan Zachary Friggstad Zhihan Gao

Published in: APPROX-RANDOM (2012)

Keyphrases

minimum cost
np hard
network flow
network flow problem
capacity constraints
approximation algorithms
query optimization
spanning tree
network simplex algorithm
join algorithms
minimum cost flow
undirected graph
worst case
linear programming
connected components
edit operations