Brief Announcement: A Log-Time Local MDS Approximation Scheme for Bounded Genus Graphs

Brief Announcement: A Log-Time Local MDS Approximation Scheme for Bounded Genus Graphs

Content
Grafik
Abstract

This paper shows that the results by Czygrinow et al. (DISC 2008) and Amiri et al. (PODC 2016) can be combined to obtain a O(log∗ n)-time local and deterministic approximation scheme for Minimum Dominating Sets on bounded genus graphs.

Grafik Top
Authors
  • Akhoondian Amiri, Saeed
  • Schmid, Stefan
Grafik Top
Supplemental Material
Shortfacts
Category
 Paper in Conference Proceedings or in Workshop Proceedings (Other)
Event Title
 30th International Symposium on Distributed Computing (DISC)
Divisions
 Communication Technologies
Subjects
 Informatik Allgemeines
Event Location
 Paris, France
Event Type
 Conference
Event Dates
 September 2016
Date
 2016
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.