BibTeX Export for Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks

Copy to Clipboard Download

@InProceedings{mihalak_et_al:OASIcs.ATMOS.2015.82,
  author =	{Mihal\'{a}k, Mat\'{u}\v{s} and Montanari, Sandro},
  title =	{{Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks}},
  booktitle =	{15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
  pages =	{82--94},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-99-6},
  ISSN =	{2190-6807},
  year =	{2015},
  volume =	{48},
  editor =	{Italiano, Giuseppe F. and Schmidt, Marie},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.82},
  URN =		{urn:nbn:de:0030-drops-54561},
  doi =		{10.4230/OASIcs.ATMOS.2015.82},
  annote =	{Keywords: shortest path, time-dependent, bi-criteria, bi-directional search, min-max relative regret}
}

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