Online computation and competitive analysis:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1998
|
| Ausgabe: | 1. publ. |
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214089&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke |
| Umfang: | xviii, 414 Seiten Illustrationen |
| ISBN: | 0521563925 0521619467 9780521619462 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV012129013 | ||
| 003 | DE-604 | ||
| 005 | 20210805 | ||
| 007 | t| | ||
| 008 | 980828s1998 xx a||| |||| 00||| eng d | ||
| 020 | |a 0521563925 |c hbk. |9 0-521-56392-5 | ||
| 020 | |a 0521619467 |c pbk. |9 0-521-61946-7 | ||
| 020 | |a 9780521619462 |c pbk. |9 978-0-521-61946-2 | ||
| 035 | |a (OCoLC)439209988 | ||
| 035 | |a (DE-599)BVBBV012129013 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-91G |a DE-706 |a DE-634 |a DE-83 |a DE-188 |a DE-703 |a DE-384 |a DE-29T | ||
| 050 | 0 | |a QA76.9.A43 | |
| 080 | |a 519.68 | ||
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a QH 500 |0 (DE-625)141607: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a PHY 629f |2 stub | ||
| 084 | |a 68Wxx |2 msc | ||
| 084 | |a MAT 519f |2 stub | ||
| 100 | 1 | |a Borodin, Allan |d 1941- |e Verfasser |0 (DE-588)174097077 |4 aut | |
| 245 | 1 | 0 | |a Online computation and competitive analysis |c Allan Borodin (University of Toronto), Ran El-Yaniv (Technion - Israel Institute of Technology) |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1998 | |
| 300 | |a xviii, 414 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a El-Yaniv, Ran |d 1962- |e Verfasser |0 (DE-588)1146067151 |4 aut | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214089&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008214089 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0104 DAT 530f 2001 A 8321 0303 DAT 530f 2014 L 469 |
|---|---|
| DE-BY-TUM_katkey | 973469 |
| DE-BY-TUM_location | 01 03 |
| DE-BY-TUM_media_number | 040010561267 040080118278 040080118234 040080118256 040080118245 040080118267 040010563714 040008199579 040008199580 040008199604 040008199591 040008199615 |
| _version_ | 1821931203039592448 |
| adam_text | Titel: Online computation and competitive analysis
Autor: Borodin, Allan
Jahr: 2005
Contents
Preface page xiii
1 Introduction to Competitive Analysis: The List Accessing
Problem 1
1.1 Basic Ideas and Terminology 1
1.2 The List Accessing Problem 4
1.3 The Sleator-Tarjan Result 6
1.4 The Potential Function Method 9
1.5 Some Lower Bounds 10
1.6 The List Factoring Technique 13
1.7 Historical Notes and Open Questions 19
2 Introduction to Randomized Algorithms: The List Accessing
Problem 23
2.1 The Competitive Ratio of Randomized Algorithms 23
2.2 Algorithm BIT 24
2.3 Algorithm RMTF: Barely Random Versus Random 26
2.4 List Factoring-Phase Partitioning Revisited 27
2.5 COMB: An f-Competitive Algorithm 29
2.6 Historical Notes and Open Questions 29
3 Paging: Deterministic Algorithms 32
3.1 Some Paging Algorithms 33
3.2 The (h. Ai-Paging Problem 34
3.3 List Accessing Algorithms as Paging Algorithms 35
3.4 LFD - An Optimal Offline Paging Algorithm 35
3.5 Marking and Conservative Algorithms and the
Competitiveness of LRU, CLOCK, FIFO, and FWF 36
3.6 LIFO and LFU Are Not Competitive 39
3.7 The Full Access Cost Model 40
CONTENTS
3.8 Theory Versus Practice 41
3.9 Historical Notes and Open Questions 42
Paging: Randomized Algorithms 44
4.1 Randomized Competitive Analysis 44
4.2 The Competitiveness of RANDOM 46
4.3 The MARK Algorithm 49
4.4 A Lower Bound for Randomized Paging Algorithms 51
4.5 Historical Notes and Open Questions 52
Alternative Paging Models: Beyond Pure Competitive Analysis 54
5.1 The Access Graph Model 54
5.2 Dynamic Access Graphs and Experimental Studies 65
5.3 Distributional Paging Models 68
5.4 Historical Notes and Open Questions 75
Game Theoretic Foundations 78
6.1 Games in Extensive and Strategic Forms 78
6.2 Randomized Strategies: Mixed, Behavioral, and General 83
6.3 Equivalence Theorems for Linear Games and Games of
Perfect Recall 89
6.4 An Application to Paging and Competitive Analysis 93
6.5 Historical Notes and Open Questions 95
Request-Answer Games 98
7.1 Request-Answer Games 98
7.2 Randomized Adversaries 102
7.3 Relating the Adversaries 104
7.4 Historical Notes and Open Questions 107
Competitive Analysis and Zero-Sum Games 109
8.1 Two-Person Zero-Sum Games 109
8.2 On Generalizations of the Minimax Theorem for Infinite
Games 114
8.3 Yao s Principle: A Technique for Obtaining Lower Bounds 115
8.4 Paging Revisited 120
8.5 Historical Notes 122
Metrical Task Systems 123
9.1 Formulation of (Metrical) Task Systems 123
9.2 An 8( JV - 1 )-Competitive Traversal Algorithm 127
9.3 A 2 ¥ - 1 Lower Bound 128
CONTENTS IX
9.4 An Optimal Work Function MTS Algorithm 131
9.5 A Randomized Algorithm for a Uniform MTS 134
9.6 A Randomized Polylogarithmic Competitive Algorithm for
Any MTS 135
9.7 Historical Notes and Open Questions 146
10 The ^-Server Problem 150
10.1 The Formulation of the Model 150
10.2 Some Basic Aspects of the A-Server Problem 151
10.3 A Deterministic Lower Bound 153
10.4 A-Servers on a Line and a Tree 155
10.5 An Efficient 3-Competitive 2-Server Algorithm for
Euclidean Spaces 159
10.6 Balancing Algorithms 161
10.7 The k-Server Work Function Algorithm 164
10.8 On Generalizations of the A-Server Conjecture That Fail 175
10.9 Historical Notes and Open Questions 178
11 Randomized fe-Server Algorithms 182
11.1 Oblivious Adversaries and Two Randomized A-Server
Algorithms for the Circle 182
11.2 A Lower Bound Against an Adaptive-Online Adversary 185
11.3 The Cat and Rat Game and Applications to Randomized
A-Server Algorithms 186
11.4 The Harmonic Random Walk 191
11.5 The HARMONIC A-Server Algorithm on an Arbitrary Metric
Space 192
11.6 The Resistive Approach 196
11.7 Historical Notes and Open Questions 199
12 Load Balancing 201
12.1 Defining the Problem 201
12.2 Online Algorithms for Load Balancing of Permanent Jobs 204
12.3 Formulating the Machine Assignment Problem as a Generalized
Virtual Circuit Routing Problem 210
12.4 Load Balancing of Temporary Jobs 213
12.5 Bin Packing 218
12.6 Historical Notes and Open Questions 222
13 Call Admission and Circuit Routing 226
13.1 Specifying the Problem 226
X CONTENTS
13.2 Throughput Maximization for Permanent Calls in Networks
with Large Edge Capacities 227
13.3 Throughput Maximization for Limited Duration Calls 232
13.4 Experimental Results 234
13.5 Call Admission for Particular Networks: The Disjoint Paths
Problem 237
13.6 The Disjoint Paths Problem: A Lower Bound for a Difficult
Network 245
13.7 Routing on Optical Networks 250
13.8 Path Coloring for Particular Networks 253
13.9 A Lower Bound for Path Coloring on the Brick Wall Graph 259
13.10 Historical Notes and Open Problems 260
14 Search, Trading, and Portfolio Selection 264
14.1 Online Search and One-Way Trading 264
14.2 Online Portfolio Selection 273
14.3 Two-Way Trading: Statistical Adversaries and
Money Making Algorithms 277
14.4 Two-Way Trading and the Fixed Fluctuation Model 281
14.5 Weighted Portfolio Selection Algorithms 290
14.6 Historical Notes and Open Questions 307
15 On Decision Theories and the Competitive Ratio 312
15.1 Certainty, Risk, and Strict Uncertainty 312
15.2 Decision Making Under Strict Uncertainty 315
15.3 The Competitive Ratio Axioms 321
15.4 Characterization of the Competitive Ratio 325
15.5 Characterizations of the Classical Criteria for Strict
Uncertainty 333
i 5.6 An Example - The Leasing Problem 335
15.7 Decision Making Under Risk 339
15.8 Bayesian Approaches for Decision Making Under
Uncertainty 346
15.9 Historical Notes and Open Questions 348
A Glossary 355
B Stochastic Analyses for List Accessing Algorithms 357
C The Harmonic Random Walk and Its Connection to
Electrical Networks 361
CONTENTS XI
D Proof of Lemmas 5.4 and 5.5 in Theorem 5.11: FAR Is a
Uniformly Optimal Online Paging Algorithm 364
D. 1 Proof of Lemma 5.4: Type I Reps and the Construction of 7 364
D.2 Proof of Lemma 5.5: Type 2 Reps and the Construction of H 365
E Some Tools from Renewal Theory 369
E.l Renewal Processes 369
E.2 Wald s Equation 370
E.3 The Elementary Renewal Theorem 373
F Proof of Theorem 13.14: Disjoint Paths in an Array 375
F.l Short Distance Calls 375
F.2 Long Distance Calls 376
G Some Tools from the Theory of Types 379
H Two Technical Lemmas 382
Bibliography 389
Index 403
|
| any_adam_object | 1 |
| author | Borodin, Allan 1941- El-Yaniv, Ran 1962- |
| author_GND | (DE-588)174097077 (DE-588)1146067151 |
| author_facet | Borodin, Allan 1941- El-Yaniv, Ran 1962- |
| author_role | aut aut |
| author_sort | Borodin, Allan 1941- |
| author_variant | a b ab r e y rey |
| building | Verbundindex |
| bvnumber | BV012129013 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | QH 500 ST 130 |
| classification_tum | PHY 629f MAT 519f |
| ctrlnum | (OCoLC)439209988 (DE-599)BVBBV012129013 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Physik Informatik Mathematik Wirtschaftswissenschaften |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02060nam a2200517 c 4500</leader><controlfield tag="001">BV012129013</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210805 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">980828s1998 xx a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521563925</subfield><subfield code="c">hbk.</subfield><subfield code="9">0-521-56392-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521619467</subfield><subfield code="c">pbk.</subfield><subfield code="9">0-521-61946-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521619462</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-0-521-61946-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)439209988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012129013</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-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="080" ind1=" " ind2=" "><subfield code="a">519.68</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 500</subfield><subfield code="0">(DE-625)141607:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">PHY 629f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Wxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 519f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Borodin, Allan</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)174097077</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Online computation and competitive analysis</subfield><subfield code="c">Allan Borodin (University of Toronto), Ran El-Yaniv (Technion - Israel Institute of Technology)</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xviii, 414 Seiten</subfield><subfield code="b">Illustrationen</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">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">El-Yaniv, Ran</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1146067151</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214089&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008214089</subfield></datafield></record></collection> |
| id | DE-604.BV012129013 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T10:24:51Z |
| institution | BVB |
| isbn | 0521563925 0521619467 9780521619462 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008214089 |
| oclc_num | 439209988 |
| open_access_boolean | |
| owner | DE-739 DE-91G DE-BY-TUM DE-706 DE-634 DE-83 DE-188 DE-703 DE-384 DE-29T |
| owner_facet | DE-739 DE-91G DE-BY-TUM DE-706 DE-634 DE-83 DE-188 DE-703 DE-384 DE-29T |
| physical | xviii, 414 Seiten Illustrationen |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Cambridge University Press |
| record_format | marc |
| spellingShingle | Borodin, Allan 1941- El-Yaniv, Ran 1962- Online computation and competitive analysis Computational complexity Computer algorithms Mathematical optimization Algorithmus (DE-588)4001183-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4011152-0 |
| title | Online computation and competitive analysis |
| title_auth | Online computation and competitive analysis |
| title_exact_search | Online computation and competitive analysis |
| title_full | Online computation and competitive analysis Allan Borodin (University of Toronto), Ran El-Yaniv (Technion - Israel Institute of Technology) |
| title_fullStr | Online computation and competitive analysis Allan Borodin (University of Toronto), Ran El-Yaniv (Technion - Israel Institute of Technology) |
| title_full_unstemmed | Online computation and competitive analysis Allan Borodin (University of Toronto), Ran El-Yaniv (Technion - Israel Institute of Technology) |
| title_short | Online computation and competitive analysis |
| title_sort | online computation and competitive analysis |
| topic | Computational complexity Computer algorithms Mathematical optimization Algorithmus (DE-588)4001183-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| topic_facet | Computational complexity Computer algorithms Mathematical optimization Algorithmus Datenverarbeitung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008214089&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT borodinallan onlinecomputationandcompetitiveanalysis AT elyanivran onlinecomputationandcompetitiveanalysis |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0104 DAT 530f 2001 A 8321 Lageplan |
|---|---|
| Exemplar 1 | Nicht ausleihbar Am Standort |
Teilbibliothek Chemie, Lehrbuchsammlung
| Signatur: |
0303 DAT 530f 2014 L 469 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |
| Exemplar 2 | Ausleihbar Am Standort |
| Exemplar 3 | Ausleihbar Am Standort |
| Exemplar 4 | Ausleihbar Am Standort |
| Exemplar 5 | Ausleihbar Am Standort |
| Exemplar 6 | Ausleihbar Am Standort |
| Exemplar 7 | Ausleihbar Am Standort |
| Exemplar 8 | Ausleihbar Am Standort |
| Exemplar 9 | Ausleihbar Am Standort |
| Exemplar 10 | Ausleihbar Am Standort |
| Exemplar 11 | Ausleihbar Am Standort |