Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications /
Bewaard in:
| Andere auteurs: | , , |
|---|---|
| Formaat: | Boek |
| Taal: | English |
| Gepubliceerd in: |
Berlin ; New York :
Springer,
©2006.
|
| Reeks: | Lecture notes in computer science ;
3484. Lecture notes in computer science. State-of-the-art survey. |
| Onderwerpen: |
| LEADER | 03467cam a2200589 a 4500 | ||
|---|---|---|---|
| 001 | c000406294 | ||
| 003 | CARM | ||
| 005 | 20200827094716.0 | ||
| 008 | 200827s2006 gw a b 001 0 eng d | ||
| 010 | |a 2006920093 | ||
| 015 | |a GBA633095 |2 bnb | ||
| 015 | |a 06,N07,0016 |2 dnb | ||
| 016 | 7 | |a 013427569 |2 Uk | |
| 019 | 1 | |a 69794449 |5 LACONCORD2021 | |
| 020 | |a 3540322124 | ||
| 020 | |a 9783540322122 | ||
| 035 | |a (OCoLC)460918245 |5 LACONCORD2021 | ||
| 040 | |a EQO |b eng |c EQO |d CUS |d UKM |d C$Q |d BAKER |d VRC |d PMC |d IQU |d MUQ |d YDXCP |d BTCTA |d DEBBG |d GW5XE |d OCLCQ |d E7B |d OCLCQ |d UKMGB |d OCLCF |d OCLCQ |d OCLCO |d OCLCQ | ||
| 050 | 4 | |a QA76.9.A43 |b E38 2006 | |
| 082 | 0 | 4 | |a 005.1 |2 22 |
| 245 | 0 | 0 | |a Efficient approximation and online algorithms : |b recent progress on classical combinatorial optimization problems and new applications / |c Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.). |
| 260 | |a Berlin ; |a New York : |b Springer, |c ©2006. | ||
| 300 | |a vi, 347 pages : |b illustrations ; |c 24 cm | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a unmediated |b n |2 rdamedia | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science, |x 0302-9743 ; |v 3484. |a State-of-the-art survey | |
| 504 | |a Includes bibliographical references and index. | ||
| 530 | |a Also issued online. | ||
| 505 | 0 | |a 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. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Online algorithms. | |
| 650 | 0 | |a Combinatorial optimization |x Data processing. | |
| 650 | 6 | |a Optimisation combinatoire. | |
| 650 | 6 | |a Algorithmes en ligne. | |
| 650 | 7 | |a Combinatorial optimization |x Data processing. |2 fast |0 (OCoLC)fst00868981 | |
| 650 | 7 | |a Computer algorithms. |2 fast |0 (OCoLC)fst00872010 | |
| 650 | 7 | |a Online algorithms. |2 fast |0 (OCoLC)fst01045924 | |
| 650 | 7 | |a Approximationsalgorithmus |2 gnd | |
| 650 | 7 | |a Kombinatorische Optimierung |2 gnd | |
| 650 | 7 | |a Online-Algorithmus |2 gnd | |
| 700 | 1 | |a Bampis, Evripidis. | |
| 700 | 1 | |a Jansen, Klaus. | |
| 700 | 1 | |a Kenyon, Claire. | |
| 852 | 8 | |b CARM |i B12824 |p 0658863 |f BK | |
| 852 | 8 | |b SCAN |h A3:AI14B0 |i B12824 |p 0658863 |f BK | |
| 852 | 8 | |b SCAN |h A3:AI14B0 |i B12824 |p 0658863 |f BK | |
| 830 | 0 | |a Lecture notes in computer science ; |v 3484. | |
| 830 | 0 | |a Lecture notes in computer science. |p State-of-the-art survey. | |
| 999 | f | f | |i 8ff17ca0-1deb-5b58-80cf-f5f5b43be88d |s 1ac0b5c9-1ad0-58c2-af7a-0262dc4985b0 |
| 952 | f | f | |p Can circulate |a CAVAL |b CAVAL |c CAVAL |d CARM 1 Store |e B12824 |h Other scheme |i book |m 0658863 |
| 952 | f | f | |a CAVAL |b CAVAL |c CAVAL |d Unmapped Location |e B12824 |f A3:AI14B0 |h Other scheme |