Pooja Goyal, B. S. Panda 0001. Hardness and Approximation Results of Roman {3}-Domination in Graphs. In Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee, editors, Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Volume 13025 of Lecture Notes in Computer Science, pages 101-111, Springer, 2021. [doi]
@inproceedings{GoyalP21-1,
title = {Hardness and Approximation Results of Roman {3}-Domination in Graphs},
author = {Pooja Goyal and B. S. Panda 0001},
year = {2021},
doi = {10.1007/978-3-030-89543-3_9},
url = {https://doi.org/10.1007/978-3-030-89543-3_9},
researchr = {https://researchr.org/publication/GoyalP21-1},
cites = {0},
citedby = {0},
pages = {101-111},
booktitle = {Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
editor = {Chi-Yeh Chen and Wing-Kai Hon and Ling-Ju Hung and Chia-Wei Lee},
volume = {13025},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-89543-3},
}