http://scholars.ntou.edu.tw/handle/123456789/25358
標題: | Leaf sector covers with applications on circle graphs |
作者: | Mu, Ta-Yu Wang, Po -Yuan Lin, Ching -Chi |
關鍵字: | Circle graph;Total domination;Paired-domination;Approximation algorithm |
公開日期: | 2024 |
出版社: | ELSEVIER |
卷: | 1003 |
來源出版物: | THEORETICAL COMPUTER SCIENCE |
摘要: | Damian and Pemmaraju (2002) [8] introduced leaf sector covers for circle graphs and presented an O ( n 2 )-time algorithm to find this data structure. They subsequently employed it as an algorithmic tool, leading to the development of an 8 -approximation algorithm for the dominating set problem, a (2 + e ) -approximation scheme for the dominating set problem, and a (3 + e ) - approximation scheme ... |
URI: | http://scholars.ntou.edu.tw/handle/123456789/25358 |
ISSN: | 0304-3975 |
DOI: | 10.1016/j.tcs.2024.114619 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。