%PDF-1.4
%
1 0 obj
<< /S /GoTo /D (section.1) >>
endobj
4 0 obj
(Introduction)
endobj
5 0 obj
<< /S /GoTo /D (section.2) >>
endobj
8 0 obj
(Maximum independent set for intervals )
endobj
9 0 obj
<< /S /GoTo /D (subsection.2.1) >>
endobj
12 0 obj
(Exact algorithms)
endobj
13 0 obj
<< /S /GoTo /D (subsection.2.2) >>
endobj
16 0 obj
(Lower-bound on time-space product )
endobj
17 0 obj
<< /S /GoTo /D (subsection.2.3) >>
endobj
20 0 obj
(Approximation Algorithms)
endobj
21 0 obj
<< /S /GoTo /D (section.3) >>
endobj
24 0 obj
(Maximum Independent Set for Tree)
endobj
25 0 obj
<< /S /GoTo /D (subsection.3.1) >>
endobj
28 0 obj
(Exact algorithm)
endobj
29 0 obj
<< /S /GoTo /D (subsection.3.2) >>
endobj
32 0 obj
(53-approximation algorithm using constant space)
endobj
33 0 obj
<< /S /GoTo /D (section.4) >>
endobj
36 0 obj
(Conclusion)
endobj
37 0 obj
<< /S /GoTo /D [38 0 R /Fit ] >>
endobj
53 0 obj <<
/Length 5051
/Filter /FlateDecode
>>
stream
xڽ\[s㸕~_!n9%Jܻy-mt;"%Hg-wB]Ooo֓ʴ,sLRbc6[O5}v=3i\27-z5L&ͭͅMp|ӿ߸-UO?wBj6967iY$|N*Um{gC
JZZUИ"z\,SǓcjCS:ۆ:2֩v<㉁d]~B'- ilj0yRAOaL*s3⋣@F7n(fsc,䛛~U2\?Z0G4smDR6r]ݺMDž՚BN
H|S Ư n? '.ТLͪ^s-σچWpO-c:L\uX?tu'\E4Tv i|wQDL``!N_xM͠Js_&`ߴ8'?NJ!
se~aTnk<\4^LLSQ۰*!oX(x6?e&dcnH3RM.,8h%ɲce E
t7ز^*A)\CigY)HZ;}0>\yBFOd%`t̂oo۬:-olܪ_ph>E+ dڼ',"VN~&YQw\uhvk!IB``L`Qs
2C8%S 0bLVm|,lja$AnxK\UH/aI[8p WDN
,0R:2p>v橔x˸}q(?1wu2Y>1ůɈ%-"@j` MXFyFJA CYg/@"2ƈSR61%kFj%0MZ~b
Xzs/ q3{E
Kvq a(Bkf8=W\=#K[7GM+6
Օ(P}LThr!=+eҬ3>Xz2h(
>ڤ>yrW0ΟAZ5jM]=k.2 )txSIhkB>Ƒ@?bAN?r)Kړ=)