%PDF-1.4 5 0 obj << /S /GoTo /D (section.1) >> endobj 8 0 obj (1 Introduction) endobj 9 0 obj << /S /GoTo /D (section.2) >> endobj 12 0 obj (2 Applications and Related Problems) endobj 13 0 obj << /S /GoTo /D (subsection.2.1) >> endobj 16 0 obj (2.1 Wireless Networks) endobj 17 0 obj << /S /GoTo /D (subsection.2.2) >> endobj 20 0 obj (2.2 Envy-Free Pricing) endobj 21 0 obj << /S /GoTo /D (subsection.2.3) >> endobj 24 0 obj (2.3 Max-Cut) endobj 25 0 obj << /S /GoTo /D (subsection.2.4) >> endobj 28 0 obj (2.4 Maximum Coverage) endobj 29 0 obj << /S /GoTo /D (subsection.2.5) >> endobj 32 0 obj (2.5 Radio Broadcast) endobj 33 0 obj << /S /GoTo /D (section.3) >> endobj 36 0 obj (3 Inapproximability) endobj 37 0 obj << /S /GoTo /D (subsection.3.1) >> endobj 40 0 obj (3.1 Reduction from BBIS to Unique Coverage and Proof of Theorem 3.3) endobj 41 0 obj << /S /GoTo /D (subsection.3.2) >> endobj 44 0 obj (3.2 Proving Specific Hardness Results for Unique Coverage) endobj 45 0 obj << /S /GoTo /D (section.4) >> endobj 48 0 obj (4 Approximation Algorithms) endobj 49 0 obj << /S /GoTo /D (subsection.4.1) >> endobj 52 0 obj (4.1 \(1/logm\)-Approximation) endobj 53 0 obj << /S /GoTo /D (subsection.4.2) >> endobj 56 0 obj (4.2 Approximation with Bounded Set Size) endobj 57 0 obj << /S /GoTo /D (section.A) >> endobj 60 0 obj (A Randomized Rounding for Envy-Free Pricing) endobj 61 0 obj << /S /GoTo /D [62 0 R /Fit ] >> endobj 64 0 obj << /Length 3980 /Filter /FlateDecode >> stream x˒D_ऎ]`!vXnbAmbm23=_%za_.JYάz~}ї2,JZ]()w-Bvq!{^lw\vS7%m.:ً2_.eVXe_˟^,6K%E!} xEpo V+oj=gp-2M<#&LWp)RvͶ!!}VXph!-l e!~ske1^/F ,ዮğ_ʺ/ Kp6w#~`:-c2 # !k|lhnHxȍWro+חAef_KkQ*=nioVҧswWY%Y 1oxBN9b\j jw/\] `S2w@|o@_%uGs+^DX-xSד\{:Lî|S%(N 46"Wt;^Gю5өbV`{h2 rS=dK ȟG`*x0eH30?=Ѹ)tV?eiU;oHoQ|? oI\`yu?nJmeEhuZmh qKVmV؈q2BjE>@m@QQnYK]|;̓0S"4ݏRE.B j^|aXsEP-eXo6q( ([pi,?AF ޑ=]Pcё g}-p.I:JqE[~*_"xrHc8̈C!/.bz7"W heEq[& R JX[`K^2<0s&*an+A 4{|iF&ÔrsPra{''PGAj6@q"ڻvCCˣU7on1mc3Ja4xO1"2)YU}@$(2( -G>IIMң:8YȜof2!m0p]!GnKAyExyȗBE7us 3\Q41gAgT;k~IS:A G~rX=