BibTeX record conf/alenex/FeketeMRT01

• > Home > conf/alenex/FeketeMRT01

@inproceedings{DBLP:conf/alenex/FeketeMRT01,
  author       = {S{\'{a}}ndor P. Fekete and
                  Henk Meijer and
                  Andr{\'{e}} Rohe and
                  Walter Tietze},
  editor       = {Adam L. Buchsbaum and
                  Jack Snoeyink},
  title        = {Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics
                  for Maximum Matchings and Maximum Traveling Salesman Problems},
  booktitle    = {Algorithm Engineering and Experimentation, Third International Workshop,
                  {ALENEX} 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {2153},
  pages        = {1--16},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44808-X\_1},
  doi          = {10.1007/3-540-44808-X\_1},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/alenex/FeketeMRT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}