Computing almost shortest paths - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Michael Elkin. Computing almost shortest paths. ACM Transactions on Algorithms, 1(2):283-323, 2005. [doi]

@article{Elkin05,
  title = {Computing almost shortest paths},
  author = {Michael Elkin},
  year = {2005},
  doi = {10.1145/1103963.1103968},
  url = {http://doi.acm.org/10.1145/1103963.1103968},
  researchr = {https://researchr.org/publication/Elkin05},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {1},
  number = {2},
  pages = {283-323},
}

runs on WebDSL