Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch - Domination - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-05-18 12:16:33 NP-complete problems Dominating set Approximation algorithm Domination Connected dominating set Domatic number		Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch Add to Reading List Source URL: www.tik.ee.ethz.ch Download Document from Source Website File Size: 1,04 MB Share Document on Facebook