We present a new technique for estimating the running time of an exact exponential algorithm and illustrate it on a problem of generalized domination.