Online algorithms:
"Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant pract...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York, NY ; Port Melbourne ; New Delhi ; Singapore
Cambridge University Press
2023
|
| Schlagworte: | |
| Zusammenfassung: | "Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant practical applications in operations research, big data analysis, design of communication networks, and so on. There are many different mathematical techniques that have been developed to analyse online algorithms, such as potential function arguments, primal-dual methods, and Yao's principle, to name a few. This textbook presents an easy but rigorous introduction to online algorithms for students. It starts with classical online paradigms like the ski-rental, paging, list-accessing, and bin packing, where performance of the 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. Several other popular online problems, such as metrical task systems, which includes the popular k-server problem as a special case, secretary, knapsack, bipartite matching, load balancing. scheduling to minimize flow-time, facility location, k-means clustering, travelling salesman, are also covered. A very useful technique for analysing online algorithms called the primal-dual schema is also included together with its application for multiple problems. 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. Each exercise has been broken down into simpler parts to provide a clear path towards the solution"-- |
| Beschreibung: | Literaturverzeichnis: Seite 439-461 und Index |
| Beschreibung: | xxii, 465 Seiten Diagramme |
| ISBN: | 9781009349185 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV049683834 | ||
| 003 | DE-604 | ||
| 005 | 20240619 | ||
| 007 | t | ||
| 008 | 240513s2023 xxk|||| |||| 00||| eng d | ||
| 020 | |a 9781009349185 |c Paperback |9 978-1-00-934918-5 | ||
| 035 | |a (OCoLC)1413202650 | ||
| 035 | |a (DE-599)KXP1866039199 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxk |c XA-GB |a xxu |c XD-US |a at |c XE-AU |a ii |c XB-IN |a si |c XB-SG | ||
| 049 | |a DE-83 | ||
| 082 | 0 | |a 518/.1 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 54.10 |2 bkl | ||
| 100 | 1 | |a Vaze, Rahul |e Verfasser |0 (DE-588)132269964X |4 aut | |
| 245 | 1 | 0 | |a Online algorithms |c Rahul Vaze |
| 264 | 1 | |a Cambridge ; New York, NY ; Port Melbourne ; New Delhi ; Singapore |b Cambridge University Press |c 2023 | |
| 300 | |a xxii, 465 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverzeichnis: Seite 439-461 und Index | ||
| 520 | 3 | |a "Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant practical applications in operations research, big data analysis, design of communication networks, and so on. There are many different mathematical techniques that have been developed to analyse online algorithms, such as potential function arguments, primal-dual methods, and Yao's principle, to name a few. This textbook presents an easy but rigorous introduction to online algorithms for students. It starts with classical online paradigms like the ski-rental, paging, list-accessing, and bin packing, where performance of the 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. Several other popular online problems, such as metrical task systems, which includes the popular k-server problem as a special case, secretary, knapsack, bipartite matching, load balancing. scheduling to minimize flow-time, facility location, k-means clustering, travelling salesman, are also covered. A very useful technique for analysing online algorithms called the primal-dual schema is also included together with its application for multiple problems. 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. Each exercise has been broken down into simpler parts to provide a clear path towards the solution"-- | |
| 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 | |
| 710 | 2 | |a Cambridge University Press |0 (DE-588)1008744-8 |4 pbl | |
Datensatz im Suchindex
| _version_ | 1805083852192874496 |
|---|---|
| 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 | BV049683834 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)1413202650 (DE-599)KXP1866039199 |
| 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 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV049683834</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240619</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">240513s2023 xxk|||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781009349185</subfield><subfield code="c">Paperback</subfield><subfield code="9">978-1-00-934918-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1413202650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1866039199</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="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">XA-GB</subfield><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield><subfield code="a">at</subfield><subfield code="c">XE-AU</subfield><subfield code="a">ii</subfield><subfield code="c">XB-IN</subfield><subfield code="a">si</subfield><subfield code="c">XB-SG</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.1</subfield><subfield code="2">23</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="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vaze, Rahul</subfield><subfield code="e">Verfasser</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 ; Port Melbourne ; New Delhi ; Singapore</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxii, 465 Seiten</subfield><subfield code="b">Diagramme</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverzeichnis: Seite 439-461 und Index</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant practical applications in operations research, big data analysis, design of communication networks, and so on. There are many different mathematical techniques that have been developed to analyse online algorithms, such as potential function arguments, primal-dual methods, and Yao's principle, to name a few. This textbook presents an easy but rigorous introduction to online algorithms for students. It starts with classical online paradigms like the ski-rental, paging, list-accessing, and bin packing, where performance of the 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. Several other popular online problems, such as metrical task systems, which includes the popular k-server problem as a special case, secretary, knapsack, bipartite matching, load balancing. scheduling to minimize flow-time, facility location, k-means clustering, travelling salesman, are also covered. A very useful technique for analysing online algorithms called the primal-dual schema is also included together with its application for multiple problems. 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. Each exercise has been broken down into simpler parts to provide a clear path towards the solution"--</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="710" ind1="2" ind2=" "><subfield code="a">Cambridge University Press</subfield><subfield code="0">(DE-588)1008744-8</subfield><subfield code="4">pbl</subfield></datafield></record></collection> |
| id | DE-604.BV049683834 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-20T07:55:08Z |
| institution | BVB |
| institution_GND | (DE-588)1008744-8 |
| isbn | 9781009349185 |
| language | English |
| oclc_num | 1413202650 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | xxii, 465 Seiten Diagramme |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Vaze, Rahul Verfasser (DE-588)132269964X aut Online algorithms Rahul Vaze Cambridge ; New York, NY ; Port Melbourne ; New Delhi ; Singapore Cambridge University Press 2023 xxii, 465 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Literaturverzeichnis: Seite 439-461 und Index "Online algorithms are an optimization paradigm where input is revealed sequentially and an algorithm has to make irrevocable decisions using only causal information. This is a growing area of research with great interest from the theoretical computer science community, having significant practical applications in operations research, big data analysis, design of communication networks, and so on. There are many different mathematical techniques that have been developed to analyse online algorithms, such as potential function arguments, primal-dual methods, and Yao's principle, to name a few. This textbook presents an easy but rigorous introduction to online algorithms for students. It starts with classical online paradigms like the ski-rental, paging, list-accessing, and bin packing, where performance of the 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. Several other popular online problems, such as metrical task systems, which includes the popular k-server problem as a special case, secretary, knapsack, bipartite matching, load balancing. scheduling to minimize flow-time, facility location, k-means clustering, travelling salesman, are also covered. A very useful technique for analysing online algorithms called the primal-dual schema is also included together with its application for multiple problems. 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. Each exercise has been broken down into simpler parts to provide a clear path towards the solution"-- Online-Algorithmus (DE-588)4583199-3 gnd rswk-swf Online-Algorithmus (DE-588)4583199-3 s DE-604 Cambridge University Press (DE-588)1008744-8 pbl |
| spellingShingle | Vaze, Rahul 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-Algorithmus (DE-588)4583199-3 gnd |
| topic_facet | Online-Algorithmus |
| work_keys_str_mv | AT vazerahul onlinealgorithms AT cambridgeuniversitypress onlinealgorithms |