Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications /
Uloženo v:
| Další autoři: | , , |
|---|---|
| Médium: | Kniha |
| Jazyk: | English |
| Vydáno: |
Berlin ; New York :
Springer,
©2006.
|
| Edice: | Lecture notes in computer science ;
3484. Lecture notes in computer science. State-of-the-art survey. |
| Témata: |
Obsah:
- On approximation algorithms for data mining applications / Foto N. Afrati
- A survey of approximation results for local search algorithms / Eric Angel
- Approximation algorithms for path coloring in trees / Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
- Approximation algorithms for edge-disjoint paths and unsplittable flow / Thomas Erlebach
- Independence and coloring problems on intersection graphs of disks / Thomas Erlebach, Jiří Fiala
- Approximation algorithms for min-max and max-min resource sharing problems, and applications / Klaus Jansen
- A simpler proof of preemptive total flow time approximation on parallel machines / Stefano Leonardi
- Approximating a class of classification problems / Ioannis Milis
- List scheduling in order of [alpha]-points on a single machine / Martin Skutella
- Approximation algorithms for the k-median problem / Roberto Solis-Oba
- The Lovász-Local-Lemma and scheduling / Anand Srivastav.