Onine hasingrobemsorRegular n- ons
Hiroshi Fujiwara · 2007
2.. .. . r2~~~~~~~~~~~ amdc.lforevennz.InterestinglLy, there isaremarkablLe position, there isnochoice fortheonline player andtheproblem and 1 vistrivial. Inthis paper weassume thatareqnuest isgiven asa difference between oddrn's andevenn's. (Thereason isgiven region andthattheservice canbedoneanywhere inside the attheendofSection I.)(ii) Ouranalysis istight, namely, there region. Namely, foreachrequest anonline algorithm choosesarerequest sequences forwhichthecompetitive ratio ofGRD anarbitrary point intheregion andmovestheserver there.coincides th bo vLus (iii) W lsoi relimin Ourmainresult showsthat iftheregion isaregular n-gon, the observtio ofewrfuntion algorith a showithati copttv rai ofth greyagrtmi 1 forod observation oftheworklFunction algorithmn andshowthat it competitive ratio oftheglreedy algorithm iS.n for0 oddn. 1 forSeven1i Especially for a sqnare rgi 2the workswellforhardexamples against GRD.(iv) Asforthe and foreven n.Especiallyu fora square re on,rl thegreedyu an lower bound, there is no good way of exploitinga specific algorithm turnsonttobeoptimal.