On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann† - Dominating set - Document - PDFSEARCH.IO

First Page	Meta Content
	On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann† Add to Reading List Document Date: 2011-06-03 08:54:09 Open Document File Size: 163,68 KB Share Result on Facebook

On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann†Add to Reading List