Online algorithms:
Online algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but rigorous introduction to online algorithms for graduate and senior undergraduate students. In-depth coverag...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York, NY
Cambridge University Press
2023
|
| Schlagworte: | |
| Online-Zugang: | DE-12 DE-634 DE-92 Volltext |
| Zusammenfassung: | Online algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but rigorous introduction to online algorithms for graduate and senior undergraduate students. In-depth coverage of most of the important topics is presented with special emphasis on elegant analysis. The book starts with classical online paradigms like the ski-rental, paging, list-accessing, bin packing, where performance of online algorithms is studied under the worst-case input and moves on to newer paradigms like 'beyond worst case', where online algorithms are augmented with predictions using machine learning algorithms. The book goes on to cover multiple applied problems such as routing in communication networks, server provisioning in cloud systems, communication with energy harvested from renewable sources, and sub-modular partitioning. Finally, a wide range of solved examples and practice exercises are included, allowing hands-on exposure to the concepts |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 07 May 2024) Ski-rental -- List accessing -- Bin-packing -- Paging -- Metrical task system -- Secretary problem -- Knapsack -- Bipartite matching -- Primal-dual technique -- Facility location and k-Means clustering -- Load balancing -- Scheduling to minimize flow time (delay) -- Scheduling with speed scaling -- Scheduling to minimize energy with job deadlines -- Travelling salesman -- Convex optimization (server provisioning in cloud computing) -- Multi-commodity flow routing -- Resource constrained scheduling (energy harvesting communication) -- Submodular partitioning for welfare maximization |
| Beschreibung: | 1 Online-Ressource (xxii, 465 Seiten) |
| ISBN: | 9781009349178 |
| DOI: | 10.1017/9781009349178 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV049869821 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 240917s2023 xx o|||| 00||| eng d | ||
| 020 | |a 9781009349178 |c Online |9 978-1-009-34917-8 | ||
| 024 | 7 | |a 10.1017/9781009349178 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781009349178 | ||
| 035 | |a (OCoLC)1466909702 | ||
| 035 | |a (DE-599)BVBBV049869821 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-634 | ||
| 082 | 0 | |a 518/.1 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Vaze, Rahul |0 (DE-588)132269964X |4 aut | |
| 245 | 1 | 0 | |a Online algorithms |c Rahul Vaze |
| 264 | 1 | |a Cambridge ; New York, NY |b Cambridge University Press |c 2023 | |
| 300 | |a 1 Online-Ressource (xxii, 465 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 07 May 2024) | ||
| 500 | |a Ski-rental -- List accessing -- Bin-packing -- Paging -- Metrical task system -- Secretary problem -- Knapsack -- Bipartite matching -- Primal-dual technique -- Facility location and k-Means clustering -- Load balancing -- Scheduling to minimize flow time (delay) -- Scheduling with speed scaling -- Scheduling to minimize energy with job deadlines -- Travelling salesman -- Convex optimization (server provisioning in cloud computing) -- Multi-commodity flow routing -- Resource constrained scheduling (energy harvesting communication) -- Submodular partitioning for welfare maximization | ||
| 520 | |a Online algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but rigorous introduction to online algorithms for graduate and senior undergraduate students. In-depth coverage of most of the important topics is presented with special emphasis on elegant analysis. The book starts with classical online paradigms like the ski-rental, paging, list-accessing, bin packing, where performance of online algorithms is studied under the worst-case input and moves on to newer paradigms like 'beyond worst case', where online algorithms are augmented with predictions using machine learning algorithms. The book goes on to cover multiple applied problems such as routing in communication networks, server provisioning in cloud systems, communication with energy harvested from renewable sources, and sub-modular partitioning. Finally, a wide range of solved examples and practice exercises are included, allowing hands-on exposure to the concepts | ||
| 650 | 4 | |a Online algorithms | |
| 650 | 0 | 7 | |a Online-Algorithmus |0 (DE-588)4583199-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Online-Algorithmus |0 (DE-588)4583199-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781009349185 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781009349178?locatt=mode:legacy |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035209314 | |
| 966 | e | |u https://doi.org/10.1017/9781009349178?locatt=mode:legacy |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781009349178?locatt=mode:legacy |l DE-634 |p ZDB-20-CBO |q BTU_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781009349178?locatt=mode:legacy |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1817696703074009088 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Vaze, Rahul |
| author_GND | (DE-588)132269964X |
| author_facet | Vaze, Rahul |
| author_role | aut |
| author_sort | Vaze, Rahul |
| author_variant | r v rv |
| building | Verbundindex |
| bvnumber | BV049869821 |
| classification_rvk | ST 134 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781009349178 (OCoLC)1466909702 (DE-599)BVBBV049869821 |
| dewey-full | 518/.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.1 |
| dewey-search | 518/.1 |
| dewey-sort | 3518 11 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/9781009349178 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV049869821</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">240917s2023 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781009349178</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-009-34917-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781009349178</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781009349178</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1466909702</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049869821</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vaze, Rahul</subfield><subfield code="0">(DE-588)132269964X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Online algorithms</subfield><subfield code="c">Rahul Vaze</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge ; New York, NY</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxii, 465 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 07 May 2024)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Ski-rental -- List accessing -- Bin-packing -- Paging -- Metrical task system -- Secretary problem -- Knapsack -- Bipartite matching -- Primal-dual technique -- Facility location and k-Means clustering -- Load balancing -- Scheduling to minimize flow time (delay) -- Scheduling with speed scaling -- Scheduling to minimize energy with job deadlines -- Travelling salesman -- Convex optimization (server provisioning in cloud computing) -- Multi-commodity flow routing -- Resource constrained scheduling (energy harvesting communication) -- Submodular partitioning for welfare maximization</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Online algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but rigorous introduction to online algorithms for graduate and senior undergraduate students. In-depth coverage of most of the important topics is presented with special emphasis on elegant analysis. The book starts with classical online paradigms like the ski-rental, paging, list-accessing, bin packing, where performance of online algorithms is studied under the worst-case input and moves on to newer paradigms like 'beyond worst case', where online algorithms are augmented with predictions using machine learning algorithms. The book goes on to cover multiple applied problems such as routing in communication networks, server provisioning in cloud systems, communication with energy harvested from renewable sources, and sub-modular partitioning. Finally, a wide range of solved examples and practice exercises are included, allowing hands-on exposure to the concepts</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Online algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781009349185</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781009349178?locatt=mode:legacy</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035209314</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009349178?locatt=mode:legacy</subfield><subfield code="l">DE-12</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009349178?locatt=mode:legacy</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BTU_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009349178?locatt=mode:legacy</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV049869821 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-06T13:11:00Z |
| institution | BVB |
| isbn | 9781009349178 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035209314 |
| oclc_num | 1466909702 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-634 |
| owner_facet | DE-12 DE-92 DE-634 |
| physical | 1 Online-Ressource (xxii, 465 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO BTU_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Vaze, Rahul (DE-588)132269964X aut Online algorithms Rahul Vaze Cambridge ; New York, NY Cambridge University Press 2023 1 Online-Ressource (xxii, 465 Seiten) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 07 May 2024) Ski-rental -- List accessing -- Bin-packing -- Paging -- Metrical task system -- Secretary problem -- Knapsack -- Bipartite matching -- Primal-dual technique -- Facility location and k-Means clustering -- Load balancing -- Scheduling to minimize flow time (delay) -- Scheduling with speed scaling -- Scheduling to minimize energy with job deadlines -- Travelling salesman -- Convex optimization (server provisioning in cloud computing) -- Multi-commodity flow routing -- Resource constrained scheduling (energy harvesting communication) -- Submodular partitioning for welfare maximization Online algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but rigorous introduction to online algorithms for graduate and senior undergraduate students. In-depth coverage of most of the important topics is presented with special emphasis on elegant analysis. The book starts with classical online paradigms like the ski-rental, paging, list-accessing, bin packing, where performance of online algorithms is studied under the worst-case input and moves on to newer paradigms like 'beyond worst case', where online algorithms are augmented with predictions using machine learning algorithms. The book goes on to cover multiple applied problems such as routing in communication networks, server provisioning in cloud systems, communication with energy harvested from renewable sources, and sub-modular partitioning. Finally, a wide range of solved examples and practice exercises are included, allowing hands-on exposure to the concepts Online algorithms Online-Algorithmus (DE-588)4583199-3 gnd rswk-swf Online-Algorithmus (DE-588)4583199-3 s DE-604 Erscheint auch als Druck-Ausgabe 9781009349185 https://doi.org/10.1017/9781009349178?locatt=mode:legacy Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Vaze, Rahul Online algorithms Online algorithms Online-Algorithmus (DE-588)4583199-3 gnd |
| subject_GND | (DE-588)4583199-3 |
| title | Online algorithms |
| title_auth | Online algorithms |
| title_exact_search | Online algorithms |
| title_full | Online algorithms Rahul Vaze |
| title_fullStr | Online algorithms Rahul Vaze |
| title_full_unstemmed | Online algorithms Rahul Vaze |
| title_short | Online algorithms |
| title_sort | online algorithms |
| topic | Online algorithms Online-Algorithmus (DE-588)4583199-3 gnd |
| topic_facet | Online algorithms Online-Algorithmus |
| url | https://doi.org/10.1017/9781009349178?locatt=mode:legacy |
| work_keys_str_mv | AT vazerahul onlinealgorithms |