Publication at Faculty of Mathematics and Physics |
2011
Abstract
In this paper we present branching algorithms for infinite classes of problems. The novelty in the design and analysis of our branching algorithms lies in the fact that the weights are redistributed over the graph by the algorithms.
Our particular setting to make this idea work is a combination of a branching approach with a recharging mechanism. We call it Branch & Recharge.
To demonstrate this approach we consider a generalized domination problem.