Search dblp for Publications

export results for "toc:db/series/lncs/lncs3484.bht:"

 download as .bib file

@incollection{DBLP:series/lncs/Afrati06,
  author       = {Foto N. Afrati},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {On Approximation Algorithms for Data Mining Applications},
  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        = {1--29},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_1},
  doi          = {10.1007/11671541\_1},
  timestamp    = {Thu, 23 Sep 2021 11:45:21 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Afrati06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/Angel06,
  author       = {Eric Angel},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {A Survey of Approximation Results for Local Search Algorithms},
  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        = {30--73},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_2},
  doi          = {10.1007/11671541\_2},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Angel06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/CaragiannisKP06,
  author       = {Ioannis Caragiannis and
                  Christos Kaklamanis and
                  Giuseppe Persiano},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {Approximation Algorithms for Path Coloring in Trees},
  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        = {74--96},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_3},
  doi          = {10.1007/11671541\_3},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/CaragiannisKP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/Erlebach06,
  author       = {Thomas Erlebach},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {Approximation Algorithms for Edge-Disjoint Paths and Unsplittable
                  Flow},
  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        = {97--134},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_4},
  doi          = {10.1007/11671541\_4},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Erlebach06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/ErlebachF06,
  author       = {Thomas Erlebach and
                  Jir{\'{\i}} Fiala},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {Independence and Coloring Problems on Intersection Graphs of Disks},
  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        = {135--155},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_5},
  doi          = {10.1007/11671541\_5},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/ErlebachF06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/Jansen06,
  author       = {Klaus Jansen},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {Approximation Algorithms for Min-Max and Max-Min Resource Sharing
                  Problems, and Applications},
  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        = {156--202},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_6},
  doi          = {10.1007/11671541\_6},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Jansen06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@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 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/series/lncs/Leonardi06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/Milis06,
  author       = {Ioannis Milis},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {Approximating a Class of Classification Problems},
  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        = {213--249},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_8},
  doi          = {10.1007/11671541\_8},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Milis06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/Skutella06,
  author       = {Martin Skutella},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {List Scheduling in Order of {\(\alpha\)}-Points on a Single Machine},
  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        = {250--291},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_9},
  doi          = {10.1007/11671541\_9},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Skutella06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/Solis-Oba06,
  author       = {Roberto Solis{-}Oba},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {Approximation Algorithms for the k-Median Problem},
  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        = {292--320},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_10},
  doi          = {10.1007/11671541\_10},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Solis-Oba06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:series/lncs/Srivastav06,
  author       = {Anand Srivastav},
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {The Lov{\'{a}}sz-Local-Lemma and Scheduling},
  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        = {321--347},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541\_11},
  doi          = {10.1007/11671541\_11},
  timestamp    = {Tue, 16 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/Srivastav06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@book{DBLP:series/lncs/3484,
  editor       = {Evripidis Bampis and
                  Klaus Jansen and
                  Claire Kenyon},
  title        = {Efficient Approximation and Online Algorithms - Recent Progress on
                  Classical Combinatorial Optimization Problems and New Applications},
  series       = {Lecture Notes in Computer Science},
  volume       = {3484},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11671541},
  doi          = {10.1007/11671541},
  isbn         = {978-3-540-32212-2},
  timestamp    = {Thu, 23 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/series/lncs/3484.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.