عنوان	Semidefinite Relaxation for Total Dominating Set Problem
نوع پژوهش	مقاله ارائه شده
کلیدواژه‌ها	Total dominating set, Integer programming, Semidefinite programming.
چکیده	Finding a solution for the combinatorial optimization problems has always been important due to their applications. But most of them are NP-Complete and unsolvable in polynomial time. Therefore, the approximation algorithms have been designed for them. One of these problems is total dominating set problem. In this paper, we present a new quadratic integer programming model for total dominating set problem and design an approximation method to find a lower bound for total dominating number.
پژوهشگران	محسن عبدالحسین زاده (نفر دوم)، مهدی جهانگیری (نفر اول)