BibTeX record conf/ipco/Bley05

download as .bib file

@inproceedings{DBLP:conf/ipco/Bley05,
  author       = {Andreas Bley},
  editor       = {Michael J{\"{u}}nger and
                  Volker Kaibel},
  title        = {On the Approximability of the Minimum Congestion Unsplittable Shortest
                  Path Routing Problem},
  booktitle    = {Integer Programming and Combinatorial Optimization, 11th International
                  {IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3509},
  pages        = {97--110},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11496915\_8},
  doi          = {10.1007/11496915\_8},
  timestamp    = {Sun, 02 Oct 2022 16:08:46 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/Bley05.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.