Similar Search Results

Narrow search

Node-weighted Steiner tree approximation in unit disk graphs

Zou, Feng; Li, Xianyue; Gao, Suogang; Wu, Weili - In: Journal of combinatorial optimization 18 (2009) 4, pp. 342-349

Persistent link: https://www.econbiz.de/10003938519

A PTAS for minimum d-hop connected dominating set in growth-bounded graphs

Gao, Xiaofeng; Wang, Wei; Zhang, Zhao; Zhu, Shiwei; Wu, … - In: Optimization letters 4 (2010) 3, pp. 321-333

Persistent link: https://www.econbiz.de/10003982635

A better constant-factor approximation for weighted dominating set in unit disk graph

Huang, Yaochun; Gao, Xiaofeng; Zhang, Zhao; Wu, Weili - In: Journal of combinatorial optimization 18 (2009) 2, pp. 179-194

Persistent link: https://www.econbiz.de/10003931380

A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs

Xu, Zhu; Wang, Wei; Shan, Shan; Wang, Zhong; Wu, Weili - In: Journal of combinatorial optimization 23 (2012) 4, pp. 443-450

Persistent link: https://www.econbiz.de/10009541350

Efficient algorithms for supergraph query processing on graph databases

Zhang, Shuoxun; Gao, Xiaofeng; Wu, Weili; Li, Jianzhong; … - In: Journal of combinatorial optimization 21 (2011) 2, pp. 159-191

Persistent link: https://www.econbiz.de/10008933355

PTAS for the minimum weighted dominating set in growth bounded graphs

Wang, Zhong; Wang, Wei; Kim, Joon-Mo; Thuraisingham, Bhavani - In: Journal of Global Optimization 54 (2012) 3, pp. 641-648

The minimum weighted dominating set (MWDS) problem is one of the classic NP-hard optimization problems in graph theory with applications in many fields such as wireless communication networks. MWDS in general graphs has been showed not to have polynomial-time constant-approximation if <InlineEquation ID="IEq1"> <EquationSource...</equationsource></inlineequation>

Persistent link: https://www.econbiz.de/10010994148