Approximating connectivity domination in weighted bounded-genus graphs (bibtex)
by Vincent Cohen-Addad, Éric Colin de Verdière, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld
Reference:
Approximating connectivity domination in weighted bounded-genus graphs (Vincent Cohen-Addad, Éric Colin de Verdière, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld), In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), 2016. (To appear)
Bibtex Entry:
@inproceedings{cckmm-acdwb-16a,
	Author = {Cohen-Addad, Vincent and Colin~de Verdière, Éric and Klein, Philip~N. and Mathieu, Claire and Meierfrankenfeld, David},
	Booktitle = {Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC)},
	Date-Added = {2016-02-03 09:18:34 +0000},
	Date-Modified = {2016-02-03 09:18:34 +0000},
	Note = {To appear},
	Title = {Approximating connectivity domination in weighted bounded-genus graphs},
	Year = {2016}}
Powered by bibtexbrowser