Online algorithms: the state of the art
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a.
Springer
1998
|
| Schriftenreihe: | Lecture notes in computer science
1442 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVIII, 436 S. |
| ISBN: | 3540649174 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012102890 | ||
| 003 | DE-604 | ||
| 005 | 19981102 | ||
| 007 | t| | ||
| 008 | 980804s1998 gw |||| 10||| eng d | ||
| 016 | 7 | |a 954134915 |2 DE-101 | |
| 020 | |a 3540649174 |9 3-540-64917-4 | ||
| 035 | |a (OCoLC)246320010 | ||
| 035 | |a (DE-599)BVBBV012102890 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-384 |a DE-739 |a DE-91G |a DE-703 |a DE-824 |a DE-521 |a DE-634 |a DE-83 |a DE-11 |a DE-706 | ||
| 050 | 0 | |a QA76.9.A43O55 1998 | |
| 082 | 0 | |a 005.1 21 | |
| 084 | |a ST 265 |0 (DE-625)143634: |2 rvk | ||
| 084 | |a DAT 530d |2 stub | ||
| 084 | |a 68Q25 |2 msc | ||
| 084 | |a 68Q20 |2 msc | ||
| 084 | |a 68R99 |2 msc | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 1 | 0 | |a Online algorithms |b the state of the art |c Amos Fiat ... (eds.) |
| 264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a. |b Springer |c 1998 | |
| 300 | |a XVIII, 436 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1442 | |
| 650 | 4 | |a Online algorithms | |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmanalyse |0 (DE-588)4175841-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1996 |z Dagstuhl |2 gnd-content | |
| 689 | 0 | 0 | |a Programmanalyse |0 (DE-588)4175841-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Fiat, Amos |e Sonstige |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1442 |w (DE-604)BV000000607 |9 1442 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008195100&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008195100 | |
Datensatz im Suchindex
| _version_ | 1820874877794516992 |
|---|---|
| adam_text |
CONTENTS
CHAPTER
1:
COMPETITIVE
ANALYSIS
OF
ALGORITHMS
1
AMOS
FIAT
&
GERHARD
J.
WOEGINGER
1
COMPETITIVE
ANALYSIS
.
1
2
APPLICATIONS
OF
COMPETITIVE
ANALYSIS
.
3
3
HISTORICAL
BACKGROUND
.
6
4
TOPICS
SURVEYED
.
8
CHAPTER
2:
SELF-ORGANIZING
DATA
STRUCTURES
13
SUSANNE
ALBERS
&
JEFFERY
WESTBROOK
1
INTRODUCTION
.
13
2
UNSORTED
LINEAR
LISTS
.
14
2.1
DETERMINISTIC
ON-LINE
ALGORITHMS
.
16
2.2
RANDOMIZED
ON-LINE
ALGORITHMS
.
20
2.3
AVERAGE
CASE
ANALYSES
OF
LIST
UPDATE
ALGORITHMS
.
27
2.4
REMARKS
.
29
3
BINARY
SEARCH
TREES
.
29
3.1
THE
OFF-LINE
PROBLEM
AND
PROPERTIES
OF
OPTIMAL
ALGORITHMS
.
33
3.2
ON-LINE
ALGORITHMS
.
35
3.3
STATE-BASED
ALGORITHMS
.
36
3.4
SIMPLE
MEMORYLESS
HEURISTICS
.
37
3.5
SPLAY
TREES
.
38
3.6
PROGRESS
ON
SPLAY
TREE
CONJECTURES
.
40
3.7
REMARKS
.
42
4
DATA
COMPRESSION:
AN
APPLICATION
OF
SELF-ORGANIZING
DATA
STRUCTURES
.
43
4.1
COMPRESSION
BASED
ON
LINEAR
LISTS
.
43
4.2
COMPRESSION
BASED
ON
SPLAY
TREES
.
47
X
CHAPTER
3:
COMPETITIVE
ANALYSIS
OF
PAGING
52
SANDY
IRANI
1
INTRODUCTION
.
52
1.1
DEFINITIONS
.
52
2
DETERMINISTIC
ALGORITHMS
.
54
3
RANDOMIZED
ALGORITHMS
.
56
4
UPPER
BOUNDS
.
56
4.1
MEMORYLESS
RANDOMIZED
PAGING
.
56
4.2
MEMORY
VERSUS
RANDOMNESS
.
57
4.3
THE
RANDOMIZED
MARKING
ALGORITHM
.
57
4.4
LOWER
BOUNDS
.
59
5
VARIATIONS
ON
COMPETITIVE
ANALYSIS
.
61
5.1
ACCESS
GRAPHS
.
61
5.2
PROBABILISTIC
ANALYSIS
.
64
5.3
DIFFUSE
ADVERSARIES
.
65
5.4
COMPARATIVE
RATIO
.
65
5.5
LOOSE
COMPETITIVENESS
.
66
5.6
MEASURING
TOTAL
MEMORY
ACCESS
TIME
.
67
5.7
LOOKAHEAD
.
68
6
VARIATIONS
ON
THE
PAGING
PROBLEM
.
70
6.1
WEIGHTED
CACHING
.
70
6.2
MULTI-SIZE
PAGES
.
70
6.3
PAGING
FOR
SHARED
CACHES
.
71
CHAPTER
4:
METRICAL
TASK
SYSTEMS,
THE
SERVER
PROBLEM
AND
THE
WORK
FUNCTION
ALGORITHM
74
MAREK
CHROBAK
&
LAWRENCE
L.
LARMORE
1
INTRODUCTION
.
74
2
METRICAL
TASK
SYSTEMS
.
74
2.1
WORK
FUNCTIONS
IN
A
TASK
SYSTEM
.
76
2.2
THE
COMPETITIVE
ANALYSIS
OF
THE
ICE
CREAM
PROBLEM
.
80
2.3
THE
WORK
FUNCTION
ALGORITHM
.
82
2.4
THE
WORK
FUNCTION
ALGORITHM
IN
UNRESTRICTED
SYSTEMS
.
82
2.5
UNIFORM
SERVICE
SYSTEMS
.
86
3
THE
A-SERVER
PROBLEM
.
87
3.1
THE
WORK
FUNCTION
ALGORITHM
.
89
3.2
QUASICONVEXITY
.
90
3.3
MAXIMIZERS
.
91
XI
3.4
PROOF
OF
(2K
-
^-COMPETITIVENESS
FOR
K
3
.
92
3.5
COMPETITIVENESS
PROOF
FOR
2
SERVERS
.
93
3.6
PROOF
FOR
K
-I
2
POINTS
.
94
CHAPTER
5:
DISTRIBUTED
PAGING
97
YAIR
BARTAL
1
INTRODUCTION
.
97
1.1
NETWORK
MODEL
.
98
2
FILE
MIGRATION
.
99
2.1
PROBLEM
DEFINITION
.
99
2.2
LOWER
BOUND
.
99
2.3
A
SIMPLE
RANDOMIZED
ALGORITHM
.
100
2.4
DETERMINISTIC
ALGORITHMS
.
101
2.5
RANDOMIZATION
AGAINST
AN
OBLIVIOUS
ADVERSARY
.
103
2.6
FC-PAGE
MIGRATION
.
103
3
FILE
ALLOCATION
.
104
3.1
PROBLEM
DEFINITION
.
104
3.2
LOWER
BOUNDS
.
104
3.3
SPECIFIC
NETWORK
TOPOLOGIES
.
105
3.4
ARBITRARY
NETWORKS
.
106
3.5
RANDOMIZATION
AGAINST
AN
OBLIVIOUS
ADVERSARY
.
108
4
DISTRIBUTED
PAGING
.
108
4.1
PRELIMINARIES
.
108
4.2
DETERMINISTIC
ALGORITHMS
.
108
4.3
RANDOMIZATION
AGAINST
AN
OBLIVIOUS
ADVERSARY
.
109
4.4
ALGORITHMS
FOR
ARBITRARY
NETWORKS
.
112
4.5
CONSTRAINED
FILE
MIGRATION
.
113
5
DISCUSSION
.
114
CHAPTER
6:
COMPETITIVE
ANALYSIS
OF
DISTRIBUTED
ALGORITHMS
118
JAMES
ASPNES
1
INTRODUCTION
.
118
2
DISTRIBUTED
SYSTEMS
.
119
3
COMPETITIVE
ANALYSIS
.
120
3.1
PAYOFFS
INSTEAD
OF
COSTS
.
121
4
SEMICOMPETITIVE
ANALYSIS
.
121
4.1
RELATIONS
BETWEEN
THE
MEASURES
.
123
XII
4.2
PAYOFFS
INSTEAD
OF
COSTS
.
123
5
MODULARITY
.
124
5.1
RELATIVE
COMPETITIVENESS
.
124
5.2
THE
COMPOSITION
THEOREM
.
126
6
EXAMPLE:
THE
WAIT-FREE
SHARED
MEMORY
MODEL
.
127
6.1
COLLECTS:
A
FUNDAMENTAL
PROBLEM
.
128
6.2
A
RANDOMIZED
ALGORITHM
FOR
REPEATED
COLLECTS
.
129
6.3
COMPETITIVE
ANALYSIS
AND
COLLECTS
.
133
6.4
A
TRADITIONAL
APPROACH:
LATENCY
COMPETITIVENESS
.
134
6.5
A
SEMICOMPETITIVE
APPROACH:
THROUGHPUT
COMPETITIVENESS
.
136
6.6
LOWER
BOUND
ON
THROUGHPUT
COMPETITIVENESS
OF
COLLECT
.
138
6.7
COMPETITIVE
COLLECT
AS
A
SUBROUTINE
.
140
7
EXAMPLE:
GUESSING
YOUR
LOCATION
IN
A
METRIC
SPACE
.
142
8
CONCLUSIONS
.
143
CHAPTER
7:
ON-LINE
PACKING
AND
COVERING
PROBLEMS
147
JANOS
CSIRIK
&
GERHARD
J.
WOEGINGER
1
INTRODUCTION
.
147
2
BASIC
DEFINITIONS
.
148
3
WORST
CASE
ANALYSIS
FOR
ONE
DIMENSIONAL
BIN
PACKING
.
150
3.1
CLASSICAL
ALGORITHMS
.
150
3.2
BOUNDED-SPACE
ALGORITHMS
.
151
3.3
THE
CURRENT
CHAMPION
.
154
3.4
LOWER
BOUNDS
.
154
4
WORST
CASE
ANALYSIS
FOR
HIGHER
DIMENSIONAL
PACKING
.
155
4.1
VECTOR
PACKING
.
156
4.2
BOX
PACKING
.
157
4.3
STRIP
PACKING
AND
TETRIS
.
158
5
DYNAMIC
BIN
PACKING
AND
VARIABLE
SIZED
BIN
PACKING
.
160
6
WORST
CASE
ANALYSIS
FOR
BIN
COVERING
PROBLEMS
.
163
7
SEMI
ON-LINE
BIN
PACKING
.
165
8
AVERAGE
CASE
ANALYSIS
FOR
ONE
DIMENSIONAL
BIN
PACKING
.
166
8.1
NEXT
FIT,
SMART
NEXT
FIT,
AND
HARMONIC
.
167
8.2
FIRST
FIT,
BEST
FIT,
AND
THE
PROBLEM
OF
WASTED
SPACE
.
168
9
AVERAGE
CASE
ANALYSIS
FOR
HIGHER
DIMENSIONAL
PACKING
.
170
10
AVERAGE
CASE
ANALYSIS
FOR
BIN
COVERING
.
171
XIII
CHAPTER
8:
ON-LINE
LOAD
BALANCING
178
YOSSI
AZAR
1
INTRODUCTION
.
178
2
DEFINITION
AND
BASIC
SCHEMES
.
181
2.1
THE
MODEL
.
181
2.2
DOUBLING
.
181
3
PERMANENT
TASKS
.
182
3.1
IDENTICAL
MACHINES
.
182
3.2
RELATED
MACHINES
.
183
3.3
RESTRICTED
ASSIGNMENT
.
184
3.4
UNRELATED
MACHINES
.
185
3.5
VIRTUAL
CIRCUIT
ROUTING
.
185
4
TEMPORARY
TASKS
UNKNOWN
DURATION
.
186
4.1
IDENTICAL
MACHINES
.
186
4.2
RELATED
MACHINES
.
187
4.3
RESTRICTED
ASSIGNMENT
.
187
4.4
UNRELATED
MACHINES
.
188
5
KNOWN
DURATION
.
188
6
REASSIGNMENTS
.
189
6.1
RESTRICTED
ASSIGNMENT
.
190
6.2
UNRELATED
MACHINES
.
191
6.3
CURRENT
LOAD
.
192
7
L
P
NORM
.
192
CHAPTER
9:
ON-LINE
SCHEDULING
196
JIRI
SGALL
1
INTRODUCTION
.
196
2
TAXONOMY
OF
ON-LINE
SCHEDULING
PROBLEMS
.
197
2.1
GENERAL
DEFINITIONS
AND
PRELIMINARIES
.
197
2.2
DIFFERENT
ON-LINE
PARADIGMS
.
198
2.3
OBJECTIVE
FUNCTIONS
.
199
2.4
RANDOMIZATION
.
200
2.5
RELEASE
TIMES
AND
DEADLINES,
PRECEDENCE
CONSTRAINTS
AND
CONFLICTING
JOBS
.
200
2.6
PREEMPTIONS
AND
RESTARTS
.
201
2.7
PARALLEL
JOBS
.
201
2.8
DIFFERENT
SPEEDS
OF
MACHINES
.
201
2.9
SHOP
SCHEDULING
.
202
XIV
2.10
VARIANTS
NOT
COVERED
IN
THIS
CHAPTER
.
202
3
GENERAL
RESULTS
AND
HISTORY
.
202
4
SCHEDULING
JOBS
ONE
BY
ONE
.
204
4.1
THE
BASIC
MODEL
.
204
4.2
RANDOMIZED
ALGORITHMS
.
205
4.3
PREEMPTIVE
SCHEDULING
.
209
4.4
SCHEDULING
WITH
REJECTIONS
.
209
4.5
DIFFERENT
SPEEDS
.
211
4.6
SHOP
SCHEDULING
.
212
4.7
MINIMIZING
THE
L
P
NORM
.
213
4.8
MINIMIZING
THE
TOTAL
COMPLETION
TIME
.
.'
.
213
4.9
OPEN
PROBLEMS
.
213
5
UNKNOWN
RUNNING
TIMES
.
214
5.1
DIFFERENT
SPEEDS
.
216
5.2
PARALLEL
JOBS
.
216
5.3
PARALLEL
JOBS
ON
SPECIFIC
NETWORKS
.
217
5.4
OTHER
OBJECTIVE
FUNCTIONS
.
219
5.5
OPEN
PROBLEMS
.
221
6
JOBS
ARRIVING
OVER
TIME
.
221
6.1
MINIMIZING
THE
MAKESPAN
.
221
6.2
MINIMIZING
THE
TOTAL
WEIGHTED
COMPLETION
TIME
.
222
6.3
MINIMIZING
THE
TOTAL
FLOW
TIME
.
224
6.4
CONFLICTING
JOBS
.
225
6.5
OPEN
PROBLEMS
.
226
7
RELAXED
NOTIONS
OF
COMPETITIVENESS
.
226
7.1
ALGORITHMS
WITH
MORE
COMPUTATIONAL
POWER
.
226
7.2
ALGORITHMS
WITH
ADDITIONAL
KNOWLEDGE
.
226
8
CONCLUSIONS
.
227
CHAPTER
10:
ON-LINE
SEARCHING
AND
NAVIGATION
232
PIOTR
BERMAN
1
INTRODUCTION
.
232
2
NAVIGATION
IN
GEOMETRIC
SCENES
.
233
3
SEARCHING
PROBLEMS
.
236
4
EXPLORATION
PROBLEMS
.
237
5
LOCALIZATION
PROBLEMS
.
239
6
BEYOND
COMPETITIVE
ANALYSIS
.
239
XV
CHAPTER
11:
ON-LINE
NETWORK
ROUTING
242
STEFANO
LEONARDI
1
INTRODUCTION
.
242
1.1
STRUCTURE
OF
THE
CHAPTER
.
245
2
ON-LINE
VIRTUAL
CIRCUIT
ROUTING
.
245
2.1
THE
APPLICATIONS
OF
THE
EXPONENTIAL
FUNCTION
.
246
2.2
THE
EDGE-DISJOINT
PATH
PROBLEM
.
253
2.3
OTHER
MODELS
.
257
3
ON-LINE
ROUTING
IN
OPTICAL
NETWORKS
.
259
3.1
THE
LOAD
VERSION
OF
PATH
COLORING
.
260
3.2
THE
THROUGHPUT
VERSION
OF
PATH
COLORING
.
264
4
CONCLUSIONS
.
264
CHAPTER
12:
ON-LINE
NETWORK
OPTIMIZATION
PROBLEMS
268
BALA
KALYANASUNDARAM
&
KIRK
PRUHS
1
INTRODUCTION
.
268
2
MATCHING
.
270
2.1
UNWEIGHTED
MATCHING
.
270
2.2
WEIGHTED
MATCHING
.
272
3
GENERALIZED
STEINER
TREES
.
275
4
TRAVELING
SALESMAN
PROBLEMS
.
276
5
CONCLUSION
.
278
CHAPTER
13:
COLORING
GRAPHS
ON-LINE
281
HAL
A.
KIERSTEAD
1
INTRODUCTION
.
281
2
PERFORMANCE
BOUNDS
FOR
GENERAL
GRAPHS
.
285
3
ON-LINE
X-BOUNDED
CLASSES
.
292
4
FIRST-FIT
X-BOUNDED
CLASSES
.
298
CHAPTER
14:
ON-LINE
ALGORITHMS
IN
MACHINE
LEARNING
306
AVRIM
BLUM
XVI
1
INTRODUCTION
.
306
2
PREDICTING
FROM
EXPERT
ADVICE
.
307
2.1
A
SIMPLE
ALGORITHM
.
307
2.2
A
BETTER
ALGORITHM
.
308
2.3
HISTORY
AND
EXTENSIONS
.
310
3
ON-LINE
LEARNING
FROM
EXAMPLES
.
311
3.1
SOME
SIMPLE
ALGORITHMS
.
315
3.2
THE
WINNOW
ALGORITHM
.
315
3.3
LEARNING
DRIFTING
DISJUNCTIONS
.
317
3.4
LEARNING
FROM
STRING-VALUED
ATTRIBUTES
AND
THE
INFINITE
ATTRIBUTE
MODEL
.
319
3.5
HISTORY
.
320
4
OPEN
PROBLEMS
.
320
5
CONCLUSIONS
.
322
CHAPTER
15:
COMPETITIVE
SOLUTIONS
FOR
ON-LINE
FINANCIAL
PROBLEMS
326
RAN
EL
YANIV
1
INTRODUCTION
.
326
1.1
GENERAL
MODELING
ISSUES
.
327
1.2
OPTIMALITY
CRITERIA
.
328
1.3
DESCRIPTIVE
VS.
PRESCRIPTIVE
THEORIES
.
328
1.4
ORGANIZATION
OF
THE
CHAPTER
.
328
2
PRELIMINARIES
.
329
2.1
ON-LINE
PROBLEMS
AND
COMPETITIVE
ANALYSIS
.
329
2.2
VIEWING
ON-LINE
PROBLEMS
AS
TWO-PLAYER
GAMES
.
330
2.3
COMPETITIVE
ANALYSIS
.
330
3
SEARCH
PROBLEMS
.
330
3.1
THE
ELEMENTARY
SEARCH
PROBLEM
.
330
3.2
APPLICATIONS
OF
SEARCH
.
331
3.3
BASIC
FEATURES
OF
BAYESIAN
RESULTS
.
332
3.4
COMPETITIVE
SEARCH
ALGORITHMS
.
333
4
REPLACEMENT
PROBLEMS
.
338
4.1
A
GENERAL
REPLACEMENT
PROBLEM
.
338
4.2
APPLICATIONS
OF
THE
REPLACEMENT
PROBLEM
.
339
4.3
ON
SOME
BAYESIAN
SOLUTIONS
FOR
THE
REPLACEMENT
PROBLEM
.
340
4.4
COMPETITIVE
REPLACEMENT
ALGORITHMS
FOR
THE
ELEMENTARY
CONTINUOUS
TIME,
FINITE
HORIZON
PROBLEM
.
341
4.5
DISCRETE
TIME
REPLACEMENT
WITH
MULTIPLE,
PERMANENT
REPLACEMENT
OPTIONS
.
344
XVII
5
TWO-WAY
TRADING
AND
PORTFOLIO
SELECTION
.
345
5.1
THE
ELEMENTARY
PORTFOLIO
SELECTION
PROBLEM
.
345
5.2
BUY-AND-HOLD
VS.
MARKET
TIMING
.
346
5.3
ON-LINE
PORTFOLIO
SELECTION
.
347
5.4
OTHER
PERFORMANCE
MEASURES
.
348
5.5
RESULTS
FOR
THE
TWO-WAY
TRADING
PROBLEM
.
349
5.6
OTHER
STATISTICAL
ADVERSARIES
AND
"
MONEY-MAKING
"
ALGORITHMS
.
.
350
5.7
THE
FIXED
FLUCTUATION
MODEL
.
353
5.8
ON-LINE
PORTFOLIO
SELECTION,
RESULTS
FOR
ARBITRARY
M
.
359
6
CONCLUDING
REMARKS
AND
DIRECTIONS
FOR
FUTURE
RESEARCH
.
368
CHAPTER
16:
ON
THE
PERFORMANCE
OF
COMPETITIVE
ALGORITHMS
IN
PRACTICE
373
ANNA
R.
KARLIN
1
INTRODUCTION
.
373
2
APPLICATIONS
OF
SKI
RENTAL
.
374
2.1
THE
SKI
RENTAL
PROBLEM
.
374
2.2
EXAMPLES
OF
SKI
RENTAL
IN
COMPUTER
SYSTEMS
.
375
2.3
RESULTS
OF
EMPIRICAL
STUDIES
.
377
3
PAGING
.
380
4
IP
PAGING
.
381
5
VIRTUAL
CIRCUIT
ROUTING
AND
ADMISSION
CONTROL
.
382
6
CONCLUSIONS
.
382
CHAPTER
17:
COMPETITIVE
ODDS
AND
ENDS
385
AMOS
FIAT
&
GERHARD
J.
WOEGINGER
1
WHAT
IT
REALLY
MEANS
.
385
2
REFINING
AND
MODIFYING
THE
RULES
.
386
2.1
THE
ACCESS
GRAPH
MODEL
.
386
2.2
COMPETING
WITH
A
DISTRIBUTED
ALGORITHM
.
386
2.3
THE
VALUE
OF
INFORMATION
IN
A
DISTRIBUTED
SETTING
.
387
2.4
LOOSELY
COMPETITIVE
ALGORITHMS
.
387
2.5
THE
DIFFUSE
ADVERSARY
.
387
2.6
COMPETING
ON
UNEQUAL
TERMS
.
388
2.7
THE
STATISTICAL
ADVERSARY
.
388
2.8
OBTAINING
BENEFIT
WITH
HIGH
PROBABILITY
.
389
XVIII
3
MORE
DISCUSSION
ON
METRICAL
TASK
SYSTEMS
AND
THE
FC-SERVER
PROBLEM
.
389
3.1
UNIVERSAL
ALGORITHMS
FOR
TASK
SYSTEMS
.
389
3.2
SOME
COMMENTS
ON
RANDOMIZED
ALGORITHMS
FOR
TASK
SYSTEMS
.
.
.
390
3.3
VARIANTS
ON
METRICAL
TASK
SYSTEMS
AND
FC-SERVER
PROBLEMS
.
390
4
MORE
OPEN
PROBLEMS
.
392
APPENDIX
A:
BIBLIOGRAPHY
ON
COMPETITIVE
ALGORITHMS
395
MAREK
CHROBAK
&
JOHN
NOGA |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV012102890 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43O55 1998 |
| callnumber-search | QA76.9.A43O55 1998 |
| callnumber-sort | QA 276.9 A43 O55 41998 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 265 |
| classification_tum | DAT 530d |
| ctrlnum | (OCoLC)246320010 (DE-599)BVBBV012102890 |
| dewey-full | 005.121 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 21 |
| dewey-search | 005.1 21 |
| dewey-sort | 15.1 221 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV012102890</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19981102</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">980804s1998 gw |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">954134915</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540649174</subfield><subfield code="9">3-540-64917-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)246320010</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012102890</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43O55 1998</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1 21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 265</subfield><subfield code="0">(DE-625)143634:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q20</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68R99</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Online algorithms</subfield><subfield code="b">the state of the art</subfield><subfield code="c">Amos Fiat ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 436 S.</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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1442</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">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1996</subfield><subfield code="z">Dagstuhl</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fiat, Amos</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1442</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1442</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=008195100&sequence=000001&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-008195100</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1996 Dagstuhl gnd-content |
| genre_facet | Konferenzschrift 1996 Dagstuhl |
| id | DE-604.BV012102890 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:06:43Z |
| institution | BVB |
| isbn | 3540649174 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008195100 |
| oclc_num | 246320010 |
| open_access_boolean | |
| owner | DE-384 DE-739 DE-91G DE-BY-TUM DE-703 DE-824 DE-521 DE-634 DE-83 DE-11 DE-706 |
| owner_facet | DE-384 DE-739 DE-91G DE-BY-TUM DE-703 DE-824 DE-521 DE-634 DE-83 DE-11 DE-706 |
| physical | XVIII, 436 S. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Online algorithms the state of the art Amos Fiat ... (eds.) Berlin ; Heidelberg ; New York ; Barcelona ; Budapest u.a. Springer 1998 XVIII, 436 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1442 Online algorithms Rechnernetz (DE-588)4070085-9 gnd rswk-swf Programmanalyse (DE-588)4175841-9 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1996 Dagstuhl gnd-content Programmanalyse (DE-588)4175841-9 s DE-604 Algorithmus (DE-588)4001183-5 s Rechnernetz (DE-588)4070085-9 s Algorithmentheorie (DE-588)4200409-3 s Fiat, Amos Sonstige oth Lecture notes in computer science 1442 (DE-604)BV000000607 1442 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008195100&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Online algorithms the state of the art Lecture notes in computer science Online algorithms Rechnernetz (DE-588)4070085-9 gnd Programmanalyse (DE-588)4175841-9 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4070085-9 (DE-588)4175841-9 (DE-588)4200409-3 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Online algorithms the state of the art |
| title_auth | Online algorithms the state of the art |
| title_exact_search | Online algorithms the state of the art |
| title_full | Online algorithms the state of the art Amos Fiat ... (eds.) |
| title_fullStr | Online algorithms the state of the art Amos Fiat ... (eds.) |
| title_full_unstemmed | Online algorithms the state of the art Amos Fiat ... (eds.) |
| title_short | Online algorithms |
| title_sort | online algorithms the state of the art |
| title_sub | the state of the art |
| topic | Online algorithms Rechnernetz (DE-588)4070085-9 gnd Programmanalyse (DE-588)4175841-9 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Online algorithms Rechnernetz Programmanalyse Algorithmentheorie Algorithmus Konferenzschrift 1996 Dagstuhl |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008195100&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT fiatamos onlinealgorithmsthestateoftheart |