BibTeX record: conf/approx/FeldmanNS11

download as .bib file

@inproceedings{DBLP:conf/approx/FeldmanNS11,
  author    = {Moran Feldman and
               Joseph Naor and
               Roy Schwartz},
  title     = {Improved Competitive Ratios for Submodular Secretary Problems (Extended
               Abstract)},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
               International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
               17-19, 2011. Proceedings},
  year      = {2011},
  pages     = {218--229},
  crossref  = {DBLP:conf/approx/2011},
  url       = {http://dx.doi.org/10.1007/978-3-642-22935-0_19},
  doi       = {10.1007/978-3-642-22935-0_19},
  timestamp = {Thu, 23 Oct 2014 15:13:01 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/FeldmanNS11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2011,
  editor    = {Leslie Ann Goldberg and
               Klaus Jansen and
               R. Ravi and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
               International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
               17-19, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  year      = {2011},
  volume    = {6845},
  publisher = {Springer},
  url       = {http://dx.doi.org/10.1007/978-3-642-22935-0},
  doi       = {10.1007/978-3-642-22935-0},
  isbn      = {978-3-642-22934-3},
  timestamp = {Thu, 23 Oct 2014 15:13:01 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/approx/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}