M-convexity of the minimum-cost packings of arborescences.

Kenjiro Takazawa

Published in: CoRR (2018)

Keyphrases

minimum cost
np hard
approximation algorithms
network flow
spanning tree
network flow problem
convex hull
capacity constraints
undirected graph
special case
minimum cost flow
path planning
knapsack problem
graph matching