Approximating minimum-cost edge-covers of crossing biset-families.

Published in: Comb. (2014)

Keyphrases

minimum cost
undirected graph
np hard
approximation algorithms
network flow
spanning tree
network flow problem
capacity constraints
edge detection
network simplex algorithm
objective function
search algorithm
weighted graph