@InProceedings{fischer_et_al:LIPIcs.DISC.2019.16,
  author =	{Fischer, Orr and Oshman, Rotem},
  title =	{{A Distributed Algorithm for Directed Minimum-Weight Spanning Tree}},
  booktitle =	{33rd International Symposium on Distributed Computing (DISC 2019)},
  pages =	{16:1--16:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-126-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{146},
  editor =	{Suomela, Jukka},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.16},
  URN =		{urn:nbn:de:0030-drops-113236},
  doi =		{10.4230/LIPIcs.DISC.2019.16},
  annote =	{Keywords: Distributed Computing, Directed Minimum Spanning Tree, Minimum Arborescence, CONGEST}
}