Low Diameter Graph Decompositions by Approximate Distance Computation. Becker, R., Emek, Y., & Lenzen, C. In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA, pages 50:1–50:29, 2020.
Low Diameter Graph Decompositions by Approximate Distance Computation [link]Paper  doi  bibtex   2 downloads  
@inproceedings{DBLP:conf/innovations/BeckerEL20,
	author = {Ruben Becker and Yuval Emek and Christoph Lenzen},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/conf/innovations/BeckerEL20.bib},
	booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS} 2020, January 12-14, 2020, Seattle, Washington, {USA}},
	crossref = {DBLP:conf/innovations/2020},
	doi = {10.4230/LIPIcs.ITCS.2020.50},
	pages = {50:1--50:29},
	timestamp = {Mon, 06 Jan 2020 16:50:09 +0100},
	title = {Low Diameter Graph Decompositions by Approximate Distance Computation},
	url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.50},
	year = {2020},
	bdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ITCS.2020.50}}

Downloads: 2