|
|
|
|
sdp technique for the total dominating set
|
|
|
|
|
|
|
|
نویسنده
|
djahangiri mehdi
|
|
منبع
|
هفتمين سمينار آناليز تابعي و كابردهاي آن - 1401 - دوره : 7 - هفتمین سمینار آنالیز تابعی و کابردهای آن - کد همایش: 01220-10879 - صفحه:0 -0
|
|
چکیده
|
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 eciency of the relaxation could be a future research direction.
|
|
کلیدواژه
|
total dominating set ,integer programming ,approximation.
|
|
آدرس
|
, iran
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|