Research Seminar
y distribution of the possible worlds. In this thesis, we study the budgeted dominating set problem on uncertain graphs with two well-studied distribution models, namely -- (1) linear reliability ordering [...] y distribution of the possible worlds. In this thesis, we study the budgeted dominating set problem on uncertain graphs with two well-studied distribution models, namely -- (1) linear reliability ordering [...] there is no such solution. We study the algorithmic complexity of the unbounded subset sum, the Frobenius problem and a generalization of both problems. More precisely, we study pseudo-polynomial time algorithms