BibTeX Export for Computing Minimum Spanning Trees with Uncertainty

Copy to Clipboard Download

@InProceedings{hoffmann_et_al:LIPIcs.STACS.2008.1358,
  author =	{Hoffmann, Michael and Erlebach, Thomas and Krizanc, Danny and Mihal'\'{a}k, Mat\'{u}s and Raman, Rajeev},
  title =	{{Computing Minimum Spanning Trees with Uncertainty}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{277--288},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Albers, Susanne and Weil, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1358},
  URN =		{urn:nbn:de:0030-drops-13581},
  doi =		{10.4230/LIPIcs.STACS.2008.1358},
  annote =	{Keywords: Algorithms and data structures; Current challenges: mobile and net computing}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode