شماره ركورد كنفرانس :
5410
عنوان مقاله :
SDP TECHNIQUE FOR THE TOTAL DOMINATING SET
عنوان به زبان ديگر :
SDP TECHNIQUE FOR THE TOTAL DOMINATING SET
پديدآورندگان :
DJAHANGIRI MEHDI Department of Mathematics, Faculty of Basic Science University of Maragheh, Maragheh, Iran
كليدواژه :
Total dominating set , Integer programming , Approximation.
عنوان كنفرانس :
هفتمين سمينار آناليز تابعي و كابردهاي آن
چكيده فارسي :
In this paper, one of the most famous NP-complete prob- lems in graph theory, the total dominating set problem, was investigated and a new quadratic integer programming model was presented. Finally, an SDP relaxation models are proposed. Finding the e ciency of the relaxation could be a future research direction.
