Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs

Guillaume Ducoffe . Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. Volume 132 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

@inproceedings{Ducoffe19-1,
  title = {Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs},
  author = {Guillaume  Ducoffe },
  year = {2019},
  doi = {10.4230/LIPIcs.ICALP.2019.49},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.49},
  researchr = {https://researchr.org/publication/Ducoffe19-1},
  cites = {0},
  citedby = {0},
  booktitle = {46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece},
  editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  volume = {132},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-109-2},
}