Minimum-Cost b-Edge Dominating Sets on Trees.

Takehiro Ito Naonori Kakimura Naoyuki Kamiyama Yusuke Kobayashi Yoshio Okamoto

Published in: Algorithmica (2019)

Keyphrases

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