First Page | Document Content | |
---|---|---|
Date: 2014-09-26 08:36:51 | 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 ListSource URL: disco.ethz.chDownload Document from Source WebsiteFile Size: 173,77 KBShare Document on Facebook |