Login / Signup
Approximating minimum-cost edge-covers of crossing biset-families
Zeev Nutov
Published in:
CoRR (2012)
Keyphrases
</>
minimum cost
undirected graph
np hard
approximation algorithms
network flow
spanning tree
network flow problem
capacity constraints
edge detection
minimum cost flow
network simplex algorithm
objective function
multi objective
weighted graph