Minimum-Cost b -Edge Dominating Sets on Trees.

Takehiro Ito Naonori Kakimura Naoyuki Kamiyama Yusuke Kobayashi Yoshio Okamoto

Published in: ISAAC (2014)

Keyphrases

minimum cost
undirected graph
np hard
minimum cost path
approximation algorithms
network flow problem
network flow
capacity constraints
spanning tree
decision trees
edit operations
tree structure
network simplex algorithm
weighted graph
edge detection
minimum cost flow
knapsack problem
optimal solution