Linearizable Special Cases of the Quadratic Shortest Path Problem

Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf. Linearizable Special Cases of the Quadratic Shortest Path Problem. In Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski, editors, Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Volume 12911 of Lecture Notes in Computer Science, pages 245-256, Springer, 2021. [doi]

@inproceedings{CelaKLOWW21,
  title = {Linearizable Special Cases of the Quadratic Shortest Path Problem},
  author = {Eranda Çela and Bettina Klinz and Stefan Lendl and James B. Orlin and Gerhard J. Woeginger and Lasse Wulf},
  year = {2021},
  doi = {10.1007/978-3-030-86838-3_19},
  url = {https://doi.org/10.1007/978-3-030-86838-3_19},
  researchr = {https://researchr.org/publication/CelaKLOWW21},
  cites = {0},
  citedby = {0},
  pages = {245-256},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers},
  editor = {Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski},
  volume = {12911},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-86838-3},
}