Linearizable Special Cases of the Quadratic Shortest Path Problem (bibtex)

by Eranda Çela, Bettina Klinz, Stefan Lendl, James B Orlin, Gerhard J Woeginger and Lasse Wulf

Reference:

Eranda Çela, Bettina Klinz, Stefan Lendl, James B Orlin, Gerhard J Woeginger and Lasse Wulf, Linearizable Special Cases of the Quadratic Shortest Path Problem, In International Workshop on Graph-Theoretic Concepts in Computer Science, Springer, 12911, 245–256, (2021).

Bibtex Entry:

@InProceedings{CelaEtAl2021a,
  author    = {{\c C}ela, Eranda and Klinz, Bettina and Lendl, Stefan and Orlin, James B and Woeginger, Gerhard J and Wulf, Lasse},
  booktitle = {International Workshop on Graph-Theoretic Concepts in Computer Science},
  title     = {Linearizable Special Cases of the Quadratic Shortest Path Problem},
  year      = {2021},
  oatype    = {Green},
  pages     = {245--256},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {12911},
  doi       = {10.1007/978-3-030-86838-3_19},
  groups    = {Project07 (Klinz), Student, External, important},
}