BibTeX record conf/wae/Muller-HannemannW01

download as .bib file

@inproceedings{DBLP:conf/wae/Muller-HannemannW01,
  author       = {Matthias M{\"{u}}ller{-}Hannemann and
                  Karsten Weihe},
  editor       = {Gerth St{\o}lting Brodal and
                  Daniele Frigioni and
                  Alberto Marchetti{-}Spaccamela},
  title        = {Pareto Shortest Paths is Often Feasible in Practice},
  booktitle    = {Algorithm Engineering, 5th International Workshop, {WAE} 2001 Aarhus,
                  Denmark, August 28-31, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2141},
  pages        = {185--198},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44688-5\_15},
  doi          = {10.1007/3-540-44688-5\_15},
  timestamp    = {Fri, 07 May 2021 11:48:35 +0200},
  biburl       = {https://dblp.org/rec/conf/wae/Muller-HannemannW01.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.