Minimum-Cost b -Edge Dominating Sets on Trees

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto. Minimum-Cost b -Edge Dominating Sets on Trees. In Hee-Kap Ahn, Chan-Su Shin, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Volume 8889 of Lecture Notes in Computer Science, pages 195-207, Springer, 2014. [doi]

Authors

Takehiro Ito

This author has not been identified. Look up 'Takehiro Ito' in Google

Naonori Kakimura

This author has not been identified. Look up 'Naonori Kakimura' in Google

Naoyuki Kamiyama

This author has not been identified. Look up 'Naoyuki Kamiyama' in Google

Yusuke Kobayashi

This author has not been identified. Look up 'Yusuke Kobayashi' in Google

Yoshio Okamoto

This author has not been identified. Look up 'Yoshio Okamoto' in Google