BibTeX record: conf/fsttcs/KonemannR03

download as .bib file

@inproceedings{DBLP:conf/fsttcs/KonemannR03,
  author    = {Jochen K{\"{o}}nemann and
               R. Ravi},
  title     = {Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost
               Steiner Trees},
  booktitle = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
               Computer Science, 23rd Conference, Mumbai, India, December 15-17,
               2003, Proceedings},
  pages     = {289--301},
  year      = {2003},
  crossref  = {DBLP:conf/fsttcs/2003},
  url       = {http://dx.doi.org/10.1007/978-3-540-24597-1_25},
  doi       = {10.1007/978-3-540-24597-1_25},
  timestamp = {Wed, 06 Jul 2011 21:20:35 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/fsttcs/KonemannR03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2003,
  editor    = {Paritosh K. Pandya and
               Jaikumar Radhakrishnan},
  title     = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
               Computer Science, 23rd Conference, Mumbai, India, December 15-17,
               2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2914},
  publisher = {Springer},
  year      = {2003},
  isbn      = {3-540-20680-9},
  timestamp = {Wed, 14 Jan 2004 12:54:08 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/fsttcs/2003},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}