Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer - Dominating set - Document - PDFSEARCH.IO

First Page	Meta Content
	Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer}@tik.ee.ethz.ch Add to Reading List Document Date: 2014-09-26 08:36:51 Open Document File Size: 173,77 KB Share Result on Facebook

Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer}@tik.ee.ethz.chAdd to Reading List