BibTeX Export for On the Size and the Approximability of Minimum Temporally Connected Subgraphs

Copy to Clipboard Download

@InProceedings{axiotis_et_al:LIPIcs.ICALP.2016.149,
  author =	{Axiotis, Kyriakos and Fotakis, Dimitris},
  title =	{{On the Size and the Approximability of Minimum Temporally Connected Subgraphs}},
  booktitle =	{43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
  pages =	{149:1--149:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-013-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{55},
  editor =	{Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.149},
  URN =		{urn:nbn:de:0030-drops-62936},
  doi =		{10.4230/LIPIcs.ICALP.2016.149},
  annote =	{Keywords: Temporal Graphs, Temporal Connectivity, Approximation Algorithms}
}

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