{"title":"常规n-Gons的在线追逐问题","authors":"H. Fujiwara, K. Iwama, Kouki Yonezawa","doi":"10.1109/RIVF.2007.369133","DOIUrl":null,"url":null,"abstract":"We consider a server location problem with only one server to move. If each request must be served on the exact position, there is no choice for the online player and the problem is trivial. In this paper we assume that a request is given as a region and that the service can be done anywhere inside the region. Namely, for each request an online algorithm chooses an arbitrary point in the region and moves the server there. Our main result shows that if the region is a regular n-gon, the competitive ratio of the greedy algorithm is 1/sin pi/2n for odd n and 1/sin pi/n for even n. Especially for a square region, the greedy algorithm turns out to be optimal.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online Chasing Problems for Regular n-Gons\",\"authors\":\"H. Fujiwara, K. Iwama, Kouki Yonezawa\",\"doi\":\"10.1109/RIVF.2007.369133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a server location problem with only one server to move. If each request must be served on the exact position, there is no choice for the online player and the problem is trivial. In this paper we assume that a request is given as a region and that the service can be done anywhere inside the region. Namely, for each request an online algorithm chooses an arbitrary point in the region and moves the server there. Our main result shows that if the region is a regular n-gon, the competitive ratio of the greedy algorithm is 1/sin pi/2n for odd n and 1/sin pi/n for even n. Especially for a square region, the greedy algorithm turns out to be optimal.\",\"PeriodicalId\":158887,\"journal\":{\"name\":\"2007 IEEE International Conference on Research, Innovation and Vision for the Future\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Conference on Research, Innovation and Vision for the Future\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2007.369133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2007.369133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider a server location problem with only one server to move. If each request must be served on the exact position, there is no choice for the online player and the problem is trivial. In this paper we assume that a request is given as a region and that the service can be done anywhere inside the region. Namely, for each request an online algorithm chooses an arbitrary point in the region and moves the server there. Our main result shows that if the region is a regular n-gon, the competitive ratio of the greedy algorithm is 1/sin pi/2n for odd n and 1/sin pi/n for even n. Especially for a square region, the greedy algorithm turns out to be optimal.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
