![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Efficient Approximation and Online Algorithms 2006
- Evripidis Bampis
, Klaus Jansen, Claire Kenyon:
Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Lecture Notes in Computer Science 3484, Springer 2006, ISBN 978-3-540-32212-2 - Foto N. Afrati:
On Approximation Algorithms for Data Mining Applications. 1-29 - Eric Angel:
A Survey of Approximation Results for Local Search Algorithms. 30-73 - Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Approximation Algorithms for Path Coloring in Trees. 74-96 - Thomas Erlebach:
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow. 97-134 - Thomas Erlebach, Jirí Fiala:
Independence and Coloring Problems on Intersection Graphs of Disks. 135-155 - Klaus Jansen:
Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications. 156-202 - Stefano Leonardi:
A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines. 203-212 - Ioannis Milis:
Approximating a Class of Classification Problems. 213-249 - Martin Skutella:
List Scheduling in Order of α-Points on a Single Machine. 250-291 - Roberto Solis-Oba:
Approximation Algorithms for the k-Median Problem. 292-320 - Anand Srivastav:
The Lovász-Local-Lemma and Scheduling. 321-347
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.