BibTeX record conf/infocom/LiuR01

download as .bib file

@inproceedings{DBLP:conf/infocom/LiuR01,
  author       = {Gang Liu and
                  K. G. Ramakrishnan},
  title        = {A*prune: An Algorithm for Finding {K} Shortest Paths Subject to Multiple
                  Constraints},
  booktitle    = {Proceedings {IEEE} {INFOCOM} 2001, The Conference on Computer Communications,
                  Twentieth Annual Joint Conference of the {IEEE} Computer and Communications
                  Societies, Twenty years into the communications odyssey, Anchorage,
                  Alaska, USA, April 22-26, 2001},
  pages        = {743--749},
  publisher    = {{IEEE} Comptuer Society},
  year         = {2001},
  url          = {https://doi.org/10.1109/INFCOM.2001.916263},
  doi          = {10.1109/INFCOM.2001.916263},
  timestamp    = {Thu, 23 Mar 2023 23:58:47 +0100},
  biburl       = {https://dblp.org/rec/conf/infocom/LiuR01.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.