@inproceedings{2cfd5811ff6a45fdab5d2ff1024e4469,
title = "The k-power domination problem in weighted trees",
abstract = "The power domination problem of the graph comes from how to choose the node location problem of the least phase measurement units in the electric power system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for k-power domination problem in weighted trees.",
keywords = "Dynamic programming, Linear time algorithm, Power domination, Weighted trees",
author = "Cheng, \{Chang Jie\} and Changhong Lu and Yu Zhou",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018 ; Conference date: 03-12-2018 Through 04-12-2018",
year = "2018",
doi = "10.1007/978-3-030-04618-7\_13",
language = "英语",
isbn = "9783030046170",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "149--160",
editor = "Sergiy Butenko and Shaojie Tang and Ding-Zhu Du and David Woodruff",
booktitle = "Algorithmic Aspects in Information and Management - 12th International Conference, AAIM 2018, Proceedings",
address = "德国",
}