Author:
Fukunaga Takuro,Maehara Takanori
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs;Ambühl,2006
2. Min-power covering problems;Angel,2015
3. Steiner tree approximation via iterative randomized rounding;Byrka;J. ACM,2013
4. Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling;Chan,2012
5. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks;Cheng;Networks,2003
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Counting of spanning trees in the corona edge product network;2023 IEEE International Conference on Advances in Data-Driven Analytics And Intelligent Systems (ADACIS);2023-11-23