2009

2 ;
2.1 . . . . .
2.2 . . . . . . . . . . . . . . . . . . . .
2.3 . . . . . . . . . . . . . . . . . .

9
10
11
13

3
3.1 . . . . . . . . . . . . . . . .
3.2 . . .
3.3 (h, k) . . . . . . . . . . .
3.4
3.5 . . . . . . . . . . . . . . . . . . . . . . .

15
16
16
18
19
23

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

4 Yao
25
4.1 . . . . . . . . . . . . . . . . . . . . . . . 25
4.2 . . . . . . . . . . . . . . . . . . . . . 26
4.3 . . . . . . . . . . . . 28
5
31
5.1 MARK . . . . . . . . . . . . . . . . . . . . . . . 31
5.2 . . . . . . . . . . 33
6
6.1 . . . . .
6.2 SLOWFIT
6.3 . . .
6.4 . . . . . . . . . . . . .
6.5 . . . . . . . . .
3

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

37
. 38
. 39
. 43
. 44
. 48

7
53
7.1 . . . . . . . . . . . . . . . . . . . 53
7.2 : . . . . . . . . 55
7.3 ROBIN-HOOD . . . . . . . . . . . . . . . . . . 57
8

61

9
69
9.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
9.2 . . . . . . . . . . . . . . . . . . . . 71
9.3 . . . . . . . . . . . . . . . . 76

(online algorithms).

.

.
.
,
. ,
. (competitive analysis), ,
()
.

(competitive ratio). ALG

. , C

OPT () C ALG()
.
OPT () ALG() ()
5

 1.

ALG
,
.
ALG
. ,
ALG() . ALG
(oblivious adversaries) C

OPT () C IE[ALG()] .
, ALG = 0. ,
C :

C = max

OPT ()

IE[ALG()]

.

, () ALG C

IE[ALG()] C OPT ()
.
OPT () ALG() ()
ALG
, .

C = max

IE[ALG()]
OPT ()

0.

.

7


(,

). ,
,
.

; (ski-rental), (paging)
,

(load balancing), (bin packing),
(call admission).

1.

 2
;

.
.

. ,

.

. ,
.
, .
.

.

. ,

. ,

. ;
9

10

2.1

2. ;

.
. ,
. ,
.
1 B .
1
, . ,
= B ,
. .
1.
; = B
2 B1 .
. = B 2 B1 . t > 0,
ALGB (t) t OPT(t)
t .
ALG (t)
B = maxt B (t) B (t) = OPTB(t) .
B (t) 2 1/B , t > 0.
t
OPT(t) = min{t, B}. t-
ALGB (t) = t t < B (t t ) ALGB (t) =
2B 1 t B (B 1 B 1
t
2B1
B ). , B (t) = min{t,B}
= 1 t < B B (t) = min{t,B}
=
2B1
B

= 2 B1 t B . , B (t) 2
B 2 B1 .

1
,
B

, = B
.
2 1/B . ALG ( )
( ) = OPT( ) 2 1/B .

2.2.

11

: < B ,

( ) =

1+B
B1
B1
1+B
=
>1+
>1+
= 2 1/B
min{, B}

> B ,

( ) =

1+B
1
1+B
=
=1+
> 2 1/B.
min{, B}
B
B

( ) > 2 1/B , ,
= maxt (t) ( ) > 2 1/B .

2.2

. ,
, . ,

, .
2 1/B B
.
: ;


,
.
. ,
,
( ).

B
= B/

1+ 5
. (= 2 ).

 2. ;

12

2.
;

5+ 5
4 1.81.
. t > 0, ALG(t)
t.
B

t<
2t
t+ +B1 t<B
ALG(t) =

+ 3B 2
tB

1
t + 1 , .

1
B B 1 .
t OPT(t) =
(t)
,
2 min{t, B}. , (t) = ALG
OPT(t)
= maxt (t).
t. t < , ALG(t) = 2t OPT(t) = 2t ( t < < B ).
, (t) = 1. t < B ,

t+ +B1
1 +B1
1 +B1
= +
+
OPT(t)
2t
2
2t
2
2

B1

5+ 5
B1
=1+
1+ =
.
= 1+
2
2B/
2
4

(t) =

ALG(t)

t B ,

+ 3B 2
B/ + 3B 2
B/ + 3B
=

OPT(t)
2B
2B
2B

3
5+ 5
1
+ =
.
=
2 2
4

(t) =

ALG(t)

(t)

5+ 5
4

, , = maxt (t)

5+ 5
.
4

1. o(1), 2
; .

2.3.

2.3

13

,

. 1.81 . ,

.
. ,

B 1 B . ,

B/ 1 B/. ,
(= 1+2 5 ).
3.

5+ 5
4
1.81
;
.
. = B/.
t > 0, ALG1 (t)
t ALG2 (t)
t
. , ALG(t)
t.


ALG1 (t) =

t
t<B
2B 1 t B


ALG2 (t) =

t
t<
+B1 t

. , t > 0
ALG(t) IE[ALG(t)] = 12 (ALG1 (t) + ALG2 (t))
.
t OPT(t) = min{t, B}. ,
IE[ALG(t)]
ALG1 (t)+ALG2 (t)
(t) = OPT(t) =
,
2OPT(t)

 2. ;

14

= maxt (t). t.
t < , ALG1 (t) = ALG2 (t) = t OPT(t) = t. , (t) = 1.
t < B , OPT(t) = t, ALG1 (t) = t ALG2 (t) = +B 1. ,

(t) =

ALG1 (t) + ALG2 (t)

2 OPT(t)

t+ +B1
5+ 5
=
...
.
2t
4

t B , OPT (t) = B , ALG1 (t) = 2B 1 ALG2 (t) = + B 1.

,

(t) =

ALG1 (t) + ALG2 (t)

2 OPT(t)

+ 3B 2
5+ 5
=
...
.
2B
4

5+ 5
. (t) 4 ,
, = maxt (t)

5+ 5
.
4

. , , P = {p1 , p2 , ..., pN } N . ,
,
P k k < N .
. pi ,
pi . pi
(hit)
. , (page fault) pi
. ,
(
) pi .
.


. ,
.
15

 3.

16

3.1

,
60.
. :
LRU (least recently used): .
FIFO (rst-in-rst-out) : .
LIFO (last-in-rst-out) :
.
LFU (least frequently used) :
.
LFD (longest forward distance) :
.
.
, LFD

.
(demand paging),

. ,
.
2.
.

3.2

, LFD
.

3.2.

17

, (
;),
.
(..,
)

,
.
,
.
4. LFD
.
.
LFD .
.
1. ALG
. i, i = 1, 2, ..., ||,
ALG i
:
1. ALG i i1
ALG.
2. i , ALG i
.
ALGi () ALGi
ALG() ALG.
n = ||
. .
OPT, i = 1
OPT1 , OPT1 i = 2 OPT2 , .
OPTn LFD
.

18

3.

. ALG, ALGi .
i , ALG ALGi X {v}, X {u}, , X
k 1 u, v . u = v ,
ALG ALGi
ALGi () = ALG(). v = u ( ,
i- ).
v , ALGi ALG
u ALG v . , k 1. ,
k (.., ALG v ),
ALGi ALG
.
v ALG ALGi
, ALGi
ALG. , v ,

,
u
v .
ALG, ALGi . ,
ALGi
v ALG. ,
v , ALGi u
.

3.3

(h, k)

.
k h h k .
(h, k)- ,
k
h
k . h < k ,
.

3.4. 19
( FIFO )
Belady:
, . Belady,
.
3. LRU Belady
FIFO .
(h, k) ;

, .
,

.

3.4

LRU FIFO .
FWF (ush when full)
. FWF :
FWF:
,
.
, FWF

. , FWF .
,
,

20

3.

. , , FWF
.
( LRU FWF)
k
kh+1
(h, k)- . ,
k ((k, k)). , , ( FIFO)
k
kh+1
.

k .
: 0 . i 1, i
i 1
k . , i + 1, ,
(k + 1)-
i- .
k -. k -
.
. k -.
bit bit . , bit
1, , . k -
.
k -, k . .
FWF
, FWF
.
, -

3.4. 21
(h, k)- .
5. ALG k OPT
h k .
k
OPT.
ALG kh+1
. k -. ,
k - i 1, ALG k . k
(
k ).
. , k -,
ALG
.
i 1 q i.
i
i + 1 ( i + 1 ).
OPT h1 q
k . ,
OPT k (h1) = k h+1
. i
, OPT
k  h , k 

. OPT.
, ALG k
, ,
OPT k h + 1 . ,
:
ALG()

k
OPT () + k  ,
kh+1

ALG() OPT ()
ALG OPT, , k  k

22

3.

ALG
k -.
1. LRU .
. LRU .

LRU x
k. x
k. x
, x . , LRU
k .
x , LRU x
k .
x k - k 1 .
, k - k + 1 ,
k. ,
LRU .
FWF
LRU .
5, 1, , .
1. LRU FWF
(h, k)- .

k
kh+1

4. FIFO .

ALG
k ,
ALG k .

3.5.

23

5. LRU FIFO . , FWF .

5.
6. ALG k OPT
h k . k
ALG kh+1

OPT.
, .
2. FIFO
(h, k)- .

3.5

k
kh+1

k

k .
k
(h, k)- . , kh+1
LRU, FIFO, FWF
(h, k)- .
LFD
.
2.
k + 1 , LFD () LFD
||
k + k k1 .
. k -. k -  
||
k

k. k k -

k ,

.
  ,
k +

k+

||
k

k1
k

1=

||
k

+ k k1 .

||
k

24

3.

,
.
7. ALG k k .
. k + 1 p1 , ..., pk+1 .
ALG
. ,
2.
:
r1 i 2, ri
ALG
r1 , ..., ri1 ( k + 1 , ).
ALG .
,
ALG
LFD
k .
LIFO LFU
(
k ). LIFO.
p1 , p2 , ..., pk+1 .

= p1 , p2 , ..., pk , pk+1 , pk , pk+1 , ...

, LIFO
k + 1 .
LFU. 
. :

= p1 , p2 , ..., pk1 , (pk , pk+1 )1 .

LFU
(k 1)  . ,
. 
,
LFU
k .

 4
Yao
Yao.

. .

4.1

.

. : ,
v , ,
v
( -).
.

. ,

.
, .
,
.
25

 4. YAO

26

. , . ,
, 1.
,
.
.
.

4.2

, ,
, , . ,
, .
6.

;
, .
,
1/2 (
) 1. ,

2.
-, ( ). 1
(
).
1/2.

4.2.

27

1/2 1 + 1/2 /2. ,

2.

2, .

,
. , ,
. , :
,
p 1 p.
,
, .
p ,
. p-Random p.
(
p)

. ,
, p-Random .
p-Random p . ,
.
,
p-Random p (
) 1. ,

1/p.

 4. YAO

28

-, . 1
.
p 1 p.
p 1 + (1 p) = p( 1). ,

p(1)
.

p
p . , p-Random ( )
p

(. , p = 21
) p -Random 1/p = 2 1/.

4.3

.
,
. ,
Yao .

. P
.
ALG
. , ALG() ALG
OPT() P
. CP (ALG) ALG P C

IE[OPT()] C IE[ALG()]

4.3.

29

. ,
.
,

IE[ALG()] C IE[OPT()]
ALG() OPT()
ALG , .
Yao

P .


.
.
= 0 .

Yao. , .

, q , 1 q . q
.
,
.
,
q + (1 q).
,

. .

30

4. YAO
. 1

(
).
q + (1 q).
, . ,
(1 q)
q+(1q)
(1q) . ,

.

q ,
q . , , q = 11/
2 1/. Yao, 2 1/

.

MARK . , Yao.
, , .

5.1

MARK

MARK k .
2Hk ,
Hk
k k1- (harmonic number)
Hk = i=1 i . ln k < Hk < 1+ln k
MARK
.
MARK: , .
p
, p . , p
,
,
31

 5.

32

. p ,
.
8. MARK 2Hk
.
. k -. k -,

k -. i- k - .


k -
k -.
i- k -. mi
. k ,
.
, mi , mi
. ,
k mi () .
j - (
k -)
i- k -
kmi (j1)
.
k(j1)

j - ,
.
mi
. ,
kj+1
i- k -

mi +

km
i
j=1

mi
= mi + mi (Hk Hmi ) = mi (Hk Hmi + 1) mi Hk .
kj+1

. k - mi , i- (i 1)- k -,

5.2.

33

k + mi . ,
k - i ( ),
i- (i 1)- k mi .
k - 
m1 . , 12 i mi .

Hk i mi ,
.
7. MARK k
Hk
N = k + 1.
8. MARK
Hk ( k = 2 N = 4).

5.2

k .
Yao.
9. ALG k .
Hk .
.
I
k + 1 . 1
I . i > 1, i-
i k
I {i1 } .
k -. ,
, LFD
() Hk .

34

5.

i 2,
k .
, LFD
i,
i + 1. , k 1

.

A. k + 1
, i, A q .
i (
). , k I {i },
q 1/k . ,

Hk ,
kHk .
, . ,
,
( ) . I
k + 1 , .


.
, k -,

k + 1 ,
k -.
.
3.
k + 1

5.2.

35

kHk .
. i
i
. , 1 = 0, 2 = 1, i > i1 i 3.
IE[k+1 ].

IE[k+1 ] =
=

k+1

i=2
k+1

(IE[i ] IE[i1 ])
IE[i i1 ].

i=2

.
IE[i i1 ]
i 1
, i-
. (i 1) ,
i 1
ki+2
. ,
k
i 1 ,
k
k i + 2 (i 1)
. ,

j1

ki+2
ki+2
IE[i i1 ] =
j 1
k
k
j=1
=

k
.
ki+2

j i-
j 1 j .

j1
= 1/x2 .
j=1 j(1 x)
,

IE[k+1 ] =

k+1

i=2

1
k
=k
= kHk
ki+2
i
i=1
k

36

5.

.
3 ,
k - kHk .
A
1/k , Hk . ,
.

 6

.
. , . i

ri (1), ri (2), ..., ri (N ). ri (j)

i j
.
(makespan)
.

(unrelated machines). .
(related machines), i wi j
sj . i j
ri (j) = wi /sj . (, sj = 1 j ) (identical machines). (restricted assignments)
.
.
i j ri (j) = wi /sj j
i, ri (j) =
.

37

38

6.

.
:
GREEDY: ,

.
, GREEDY .
, SLOWFIT
.
.

6.1

,
, , . ,
:
GREEDY : , .
, .
.
10. 2 N1 N .
. 2 1/N
. ,
N (N 1) , 1,
N . 1 N 1. ,
,
2N 1. , N

6.2. SLOWFIT

39

N 1 , N . ,
2 1/N .
,

. r
w 
r. ,
r,  ( r
). ,
r
N . ,
w
N  + w OPT()  + N
.
, OPT() w . , GR ()
:

GR () =  + w


w
1
= +
+ 1
w
N
N


1
OPT() + 1
OPT()
N


1
=
2
OPT()
N

6.2

SLOWFIT

,
. , SLOWFIT . SLOWFIT ,
. -

 6.

40

SLOWFIT,
.
SLOWFIT : ,

.
.

. i, j
2,

j = arg min{i1 (k) + ri (k) 2}

k

(6.1)

i1 (j) j
i 1 SLOWFIT ri (j)
i j .
, .
11. . OPT() ,
SLOWFIT
SLOWFIT () 2.
. SLOWFIT
, SLOWFIT () 2.
. OPT()
SLOWFIT t. t. ,
t
OPT(). OPT(), t 1
j

j
t 1
.
f t1 (f ) OPT().
f = N t1 (N ) + rt (N )

6.2. SLOWFIT

41

2OPT() 2 rt (N ) t.
, t
N .
= {j : j > N }
f ( f
t1 (j) > OPT() j ).
,
t 1

,
t1
.
g
j , i
f . , rg (i ) OPT()
f i , rg (f ) rg (i ) OPT().
, f , t1 (f ) OPT()
g (f ) OPT(). ,
g , g1 (f ) + rg (f ) 2OPT() 2. f
j , g
.

.
SLOWFIT, SLOWFIT

.
SLOWFIT: . , SLOWFIT
. 0, 0 r1 (N )
. SLOWFIT 0 (
SLOWFIT) 1. , i 1,
i = 2i1 , SLOWFIT i
t SLOWFIT i1 -

 6.

42

,
.
SLOWFIT i .
12. SLOWFIT 8
.
. SLOWFIT
k , k = 2k r1 (N ). k
k . h. h = 0,
20 2OPT(), SLOWFIT 0
. h > 0, r h.
h 1
h1 r h1 = 2h1 r1 (N ),
OPT() OPT(h1 r) > 2h1 r1 (N ).
SLOWFIT :

SLOWFIT () =

h

k=0
h

SLOWFIT k (k )

2k

k=0

2 2k r1 (N ) = 2(2h+1 1)r1 (N ).

k=0

, SLOWFIT () < 8 OPT().

, :
13. .
ALG
, OPT() ALG () c (. c = 2
SLOWFIT ).
ALG , ALG() 4c OPT(). ,
ALG 4c-.

6.3.

6.3

43

.

.
,

.
14.
log N  N .
. k = log N .
N  = 2k
k + 1 . , N 
. k ,
. i i = 1, ..., k 1,
(a, b), 1
a b .
i .
, 1
.
, i k 2ki ,
, N  /2 , N  /4 ,
..., k . , i
i k ,
i. 1
0
2 1.
, j < k ,
j + 1. ,

k + 1 k + 1.

 6.

44

( )
. , i
i
i + 1. ,
.
k ,
,
k . , ,
,
.
, k + 1 =
log N  + 1.

6.4

O(log N )
.
Lp
, p 1 .
Lp .

j j , j = 1, ..., N . , Lp
:

 N 1/p
p
||p =
j
.
j=1

, :

max{j } = lim ||p .

j

Lp :

6.4.

45

p-GREEDY: ,

p- .
.
15. p 1, p-GREEDY
21/p1 1 Lp .
. n N
. j j
Lp .
yij {0, 1}
i j (yij = 1) (yij = 0).


,
i yij ri (j) = j ri (j) i
j . , ij j
i 0j = 0 .
i, p-
.
,
p-
.
N



pij

pi1,j

N




(i1,j + yij ri (j))p pi1,j .

j=1

j=1

(x + a)p xp x = i1,j , a = yij ri (j) 0, p 1.
x [0, +] ,
N



pij

j=1

pi1,j

N




(nj + yij ri (j))p pnj .

(6.2)

j=1

, .
4. p 1, t 0, ai 0, i = 1, ..., k . ,
k

i=1

((t + ai )p tp )

t+

k

i=1

ai

tp .

 6.

46

. ai = 0 i = 1, ..., k . k
k
ai > 0 = i=1 ai i = ai / . , i=1 i = 1.
z p [0, ),


(t + ai )p =

(1 i )t + i t +

p
ai

i=1


(1 i )tp + i t +

ai

(6.3)

i=1

i = 1, ..., k . (6.3),
k

((t + ai )p tp ) tp

i=1

(1 i ) k

i=1

t+

t+

i=1

p
ai

p
ai

i=1

tp

i=1

p-

:

|n |pp

pnj

j=1

n
N

 p

ij pi1,j
j=1 i=1

n
N

 p

ij pi1,j .
=
i=1 j=1

(6.2), ,

6.4.

47

4,

|n |pp

n
N



(nj + yij ri (j))p pnj

i=1 j=1

N
n



(nj + yij ri (j))p pnj

j=1 i=1

(nj +

j=1

yij ri (j))p pnj .

i=1

n

i=1 yij ri (j) = j
Minkowski ( Lp )


k

(at + bt )

t=1

1/p



k
t=1

apt

1/p



k
p
t=1 bt

1/p

p 1

at , bt 0,

|n |pp

(nj +

j )p

j=1

pnj

j=1


p1  N
p1 p
N
N



p
p

nj
+
j

pnj
=

j=1

|n |p + | |p

p

j=1

j=1

|n |pp

| |pp c = |n |p / | |p , 2cp (c + 1)p

c 21/p1 1 .

ez 1 + z ,
p-GREEDY 21/p1 1 lnp2 1.4427p.


.
5. Ap c
Lp .
, Ap cN 1/p
N .

48

6.

.

. 
Lp c
p
cN 1/p maxj j . , | |pp N maxj j | |p
N 1/p maxj j . , maxj j ||p . ||p c| |p , maxj j cN 1/p maxj j .
p-GREEDY lnp2 Lp , .
3. p-GREEDY p = ln N
e log N N
.

6.5

,
.
,
: ,

(weighted). (
), .

. G = (V, E)
rj = (sj , tj , bj )
bj sj tj .
, bj bj : E R+ .
rj Pj sj
tj e Pj bj (e).
. ,
.
, ,
(

6.5.

49

). ,
,
.

.

ROUTEEXP > 0 = (1 + ).
rj = (sj , tj , bj ), rj Pj


ePj aLj1 (e)+j (e) aLj1 (e) ,

Lj (e) =

bj (e),

ij
Pi :ePi

j (e) = Lj (e) ,
L

j (e) =

bj (e)
.

, rj



cj (e) = aLj1 (e)+j (e) aLj1 (e) = aLj1 (e) aj (e) 1 .

16. G = (V, E) m .
OPT() , ROUTEEXP () = O(log m) .

. a = (1 + ),

ax 1 x,

x [0, 1]

(6.4)

P1 , . . . , Pn ( P1 , . . . , Pn ) ROUTEEXP ( ) -

 6.

50

r1 , . . . , rn .






aLj1 (e) aj (e) 1

aLj1 (e) aj (e) 1
ePj

ePj

Pj




aLn (e) aj (e) 1

ePj

k (e) k
L

aLn (e) j (e),

ePj

(6.4)




aLj1 (e) aj (e) 1

aLn (e) j (e).

j=1 ePj

ePj




aLj1 (e) aj (e) 1

aLn (e)
j (e)

j:ePj

j:ePj

(aLn (e) 1)

aLn (e)

j (e)

j:ePj

1 OPT(r1 , . . . , rn )

aLn (e) m

aLn (e) .

6.5.

51

, < 1,

m
1


m
n (e) loga
L
1


m
Ln (e) loga

aLn (e)

ROUTEEXP () = O(log m)

(6.5)

ROUTEEXP ROUTEEXP 13.

52

6.

.
. j - sj fj ,
j - dj = fj sj . fj dj j . ,
.
ALG() ALG ,
.
, GREEDY
2 N1 , . ,
2 N1 . ,
SLOWFIT
.

7.1

, ,
, T
, . , T
53

54

7.

,
.
.
17. (
),
T ( ), ROUTE-KNOWN T ,
O(log N T )-.
. [(k1)T, kT ]
k . ( ),
:
Gk 2T N + 3T
uki,h 0 i < 2T 1 h N ,
tki+1 0 i < 2T 1,
ski 0 i < T , .
i , h
. Gk 5N T 2N :
2N T N eki,h = (uki,h , uki+1,h ), ( )
.
2N T N (uki+1,h , tki+1 ) 0 i < 2T 1 1 h N ,

( ).
N T (ski , uki,h ) 0 i < T 1 h N ,
(
).
rj =
rj (1), . . . , rj (N ), dj
(k 1)T + l, (0 l < T ),
rj skl , tkl+dj ,

7.2. :

55

bj (eki,h ) = rj (h), l i < l + dj , bj (e) = 0 e.

ROUTEEXP,
, rj .
rj k ,
Gk . ,
rj h. , h
(.. t = (k 1)T + i)
k
ek1
i+T,h , ei,h . Gk
O(log N T ) , ROUTEKNOWNT O(log N T )-.

7.2

. ,
.
18.
.

( N ).
. Li (t) i t ( t, ).
t,
. , L1 (t) L2 (t) Lq(t) (t)
Li (t) = 0 i > q(t). ,
.
1. , N
. , OPT() 1.
2. , N
Li (t) Li+1 (t) + 1, 1 i q 1.

 7.

56

3. r i
(k)
Li > 0, ALG r
i. k ,
.
. .
1.

L =
L1 (t), . . . , Lq(t) (t) L =
L1 (t ), . . . , Lq(t ) (t ),
L < L , Lj (t) = Lj (t ) j < i Li (t) < Li (t )

1 i q(t )

:
. N , . (
.)
.
k
k
(k)

(k)

L(k) =
L1 , . . . , Lq(k) ,
k .
(k)
(k)
L(k) (Li Li+1 + 1), = k .
, k
 k (k)
k+1 L(k) < L(k+1) . qi=1
Li = N
,
.
, k + 1
(k)

Li

(k)

= Li+1 > 0

i 1,
. :
1. i i + 1
. ( ALG ,
3)

7.3. ROBIN-HOOD

57

2. ,
{i, i + 1}. ALG i,
i + 1.
3. i + 1
ALG.
4. ,
.
(k+1)

(k)

k+1. Li
= Li +1 L(k) < L(k+1) .

. , l = L1 (t) = ALG()

N=

q

i=1

Li (t)

q1

(l i) = ql

i=0

q(q 1)
2

q l, l (q 1) Lq (t) > 0. l
l(l+1)
q = l 2 N ,
l

2N (1 + o(1)). ,

ALG() = ( N ).

7.3

ROBIN-HOOD

.
,

. (N 2/3 ),

O( N )) .
rj sj lj Mj .
Li (sj ) i rj ( t sj ).

58

7.

j j r1 , r2 , . . . , rj . j B(sj ) OP T , B(s0 ) = 0

B(sj ) = max{B(sj1 ), lj , N1 (lj + i Li (sj ))},
.

i sj , Li (sj ) N B(sj ).
B ,
B(sj1 ) < B(sj ), . ,
(, )
(, ).
ROBIN-HOOD r1
. rj , sj ,

i Mj sj
Li (sj ) < N B(sj ). , rj . (
, .)

19. ROBIN-HOOD (2 N + 1).

. rj

i Li (sj ) N B(sj ).

N , . ROBINHOOD rj m.

Lm (sj ) + lj

N (B(sj ) + OPT(j )) + OPT(j )

m sj , Lm (sj ) + lj
N B(sj ) + OPT(j ). m st(j) S
m [st(j) , sj ). k S
Mk ( k )
st(j) ( rk m
). st(j) ( )

N ,

h=|


kS

Mk |

N.

7.3. ROBIN-HOOD

59

kS lhk ,

lk h OPT(j )

N OPT(j ).

(7.1)

kS

, m rj

Li (sj ) + lj Lm (st(j) ) +

lk + lj

kS

<

N Bt(j) +

lk + lj ,

kS

m rt(j) ,

(2 N + 1)OPT(j ),
7.1 lk OPT(j ), k j .

60

7.