BibTeX record series/lncs/Leonardi06

download as .bib file

@incollection{DBLP:series/lncs/Leonardi06,
  author       = {Stefano Leonardi},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel
                  Machines},
  booktitle    = {Efficient Approximation and Online Algorithms - Recent Progress on
                  Classical Combinatorial Optimization Problems and New Applications},
  series       = {Lecture Notes in Computer Science},
  volume       = {3484},
  pages        = {203--212},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_7},
  doi          = {10.1007/11671541\_7},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/series/lncs/Leonardi06.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.