Inapproximability of Shortest Paths on Perfect Matching Polytopes

Jean Cardinal, Raphael Steiner. Inapproximability of Shortest Paths on Perfect Matching Polytopes. In Alberto Del Pia, Volker Kaibel, editors, Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings. Volume 13904 of Lecture Notes in Computer Science, pages 72-86, Springer, 2023. [doi]

@inproceedings{CardinalS23,
  title = {Inapproximability of Shortest Paths on Perfect Matching Polytopes},
  author = {Jean Cardinal and Raphael Steiner},
  year = {2023},
  doi = {10.1007/978-3-031-32726-1_6},
  url = {https://doi.org/10.1007/978-3-031-32726-1_6},
  researchr = {https://researchr.org/publication/CardinalS23},
  cites = {0},
  citedby = {0},
  pages = {72-86},
  booktitle = {Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},
  editor = {Alberto Del Pia and Volker Kaibel},
  volume = {13904},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-32726-1},
}