BibTeX record conf/swat/ElkinGN22

download as .bib file

@inproceedings{DBLP:conf/swat/ElkinGN22,
  author       = {Michael Elkin and
                  Yuval Gitlitz and
                  Ofer Neiman},
  editor       = {Artur Czumaj and
                  Qin Xin},
  title        = {Almost Shortest Paths with Near-Additive Error in Weighted Graphs},
  booktitle    = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
                  2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
  series       = {LIPIcs},
  volume       = {227},
  pages        = {23:1--23:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SWAT.2022.23},
  doi          = {10.4230/LIPICS.SWAT.2022.23},
  timestamp    = {Thu, 23 Jun 2022 15:53:59 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/ElkinGN22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.