## Domination analysis of combinatorial optimization algorithms and problems (2005)

### Cached

### Download Links

by
Gregory Gutin
,
Anders Yeo

Venue: | In Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (M.C. Golumbic and I. Ben-Arroyo |

Citations: | 10 - 5 self |

### BibTeX

@INPROCEEDINGS{Gutin05dominationanalysis,

author = {Gregory Gutin and Anders Yeo},

title = {Domination analysis of combinatorial optimization algorithms and problems},

booktitle = {In Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications (M.C. Golumbic and I. Ben-Arroyo},

year = {2005},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

We provide an overview of an emerging area of domination analysis (DA) of combinatorial optimization algorithms and problems. We consider DA theory and its relevance to computational practice. 1