Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs

Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski. Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs. In Dario Della Monica, Aniello Murano, Sasha Rubin, Luigi Sauro, editors, Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), Naples, Italy, September 26-28, 2017. Volume 1949 of CEUR Workshop Proceedings, pages 75-86, CEUR-WS.org, 2017. [doi]

@inproceedings{CzygrinowHWW17,
  title = {Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs},
  author = {Andrzej Czygrinow and Michal Hanckowiak and Wojciech Wawrzyniak and Marcin Witkowski},
  year = {2017},
  url = {http://ceur-ws.org/Vol-1949/ICTCSpaper05.pdf},
  researchr = {https://researchr.org/publication/CzygrinowHWW17},
  cites = {0},
  citedby = {0},
  pages = {75-86},
  booktitle = {Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), Naples, Italy, September 26-28, 2017},
  editor = {Dario Della Monica and Aniello Murano and Sasha Rubin and Luigi Sauro},
  volume = {1949},
  series = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
}