{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:43Z","timestamp":1759638103761},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319731162"},{"type":"electronic","value":"9783319731179"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73117-9_26","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T11:45:34Z","timestamp":1513856734000},"page":"367-380","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits"],"prefix":"10.1007","author":[{"given":"Huda","family":"Chuangpishit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Jurdzi\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Alshamrani, S., Kowalski, D.R., G\u0105sieniec, L.: How reduce max algorithm behaves with symptoms appearance on virtual machines in clouds. In: Proceedings of IEEE International Conference CIT\/IUCC\/DASC\/PICOM, pp. 1703\u20131710 (2015)","DOI":"10.1109\/CLOUDCOMP.2015.7149641"},{"issue":"6","key":"26_CR2","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"SK Baruah","year":"1996","unstructured":"Baruah, S.K., Cohen, N.K., Plaxton, C.G., Varvel, D.A.: Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15(6), 600\u2013625 (1996)","journal-title":"Algorithmica"},{"issue":"7","key":"26_CR3","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1109\/12.709381","volume":"47","author":"SK Baruah","year":"1998","unstructured":"Baruah, S.K., Lin, S.-S.: Pfair scheduling of generalized pinwheel task systems. IEEE Trans. Comput. 47(7), 812\u2013816 (1998)","journal-title":"IEEE Trans. Comput."},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.tcs.2015.08.027","volume":"605","author":"MA Bender","year":"2015","unstructured":"Bender, M.A., Fekete, S.P., Kr\u00f6ller, A., Mitchell, J.S.B., Liberatore, V., Polishchuk, V., Suomela, J.: The minimum backlog problem. Theoret. Comput. Sci. 605, 51\u201361 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-33475-7_5","volume-title":"Theoretical Computer Science","author":"MHL Bodlaender","year":"2012","unstructured":"Bodlaender, M.H.L., Hurkens, C.A.J., Kusters, V.J.J., Staals, F., Woeginger, G.J., Zantema, H.: Cinderella versus the wicked stepmother. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 57\u201371. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33475-7_5"},{"issue":"6","key":"26_CR6","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1109\/12.144627","volume":"41","author":"MY Chan","year":"1992","unstructured":"Chan, M.Y., Chin, F.Y.L.: General schedulers for the pinwheel problem based on double-integer reduction. IEEE Trans. Comput. 41(6), 755\u2013768 (1992)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"26_CR7","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01187034","volume":"9","author":"MY Chan","year":"1993","unstructured":"Chan, M.Y., Chin, F.: Schedulers for larger classes of pinwheel instances. Algorithmica 9(5), 425\u2013462 (1993)","journal-title":"Algorithmica"},{"key":"26_CR8","unstructured":"Chuangpishit, H., Czyzowicz, J., Gasieniec, L., Georgiou, K., Jurdzinski, T., Kranakis, E.: Patrolling a path connecting set of points with unbalanced frequencies of visits (2012). \nhttp:\/\/arxiv.org\/abs\/1710.00466"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/3-540-48224-5_70","volume-title":"Automata, Languages and Programming","author":"M Chrobak","year":"2001","unstructured":"Chrobak, M., Csirik, J., Imreh, C., Noga, J., Sgall, J., Woeginger, G.J.: The buffer minimization problem for multiprocessor scheduling with conflicts. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 862\u2013874. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-48224-5_70"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., Martin, R., Morales Ponce, O.: Optimal patrolling of fragmented boundaries. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, New York, USA, pp. 241\u2013250 (2013)","DOI":"10.1145\/2486159.2486176"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-23719-5_59","volume-title":"Algorithms \u2013 ESA 2011","author":"J Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 701\u2013712. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-23719-5_59"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-662-48971-0_30","volume-title":"Algorithms and Computation","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Krizanc, D., Taleb, N.: When patrolmen become corrupted: monitoring a graph using faulty mobile robots. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 343\u2013354. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48971-0_30"},{"issue":"1","key":"26_CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s00453-002-0938-9","volume":"34","author":"PC Fishburn","year":"2002","unstructured":"Fishburn, P.C., Lagarias, J.C.: Pinwheel scheduling: achievable densities. Algorithmica 34(1), 14\u201338 (2002)","journal-title":"Algorithmica"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-51963-0_18","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"L G\u0105sieniec","year":"2017","unstructured":"G\u0105sieniec, L., Klasing, R., Levcopoulos, C., Lingas, A., Min, J., Radzik, T.: Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors). In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 229\u2013240. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-51963-0_18"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: a real-time scheduling problem. In: II: Software Track, Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences, vol. 2, pp. 693\u2013702, January 1989","DOI":"10.1109\/HICSS.1989.48075"},{"issue":"1","key":"26_CR16","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(92)90365-M","volume":"100","author":"R Holte","year":"1992","unstructured":"Holte, R., Rosier, L., Tulchinsky, I., Varvel, D.: Pinwheel scheduling with two distinct numbers. Theoret. Comput. Sci. 100(1), 105\u2013135 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"26_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s00446-014-0226-3","volume":"28","author":"A Kawamura","year":"2015","unstructured":"Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. Distrib. Comput. 28(2), 147\u2013154 (2015)","journal-title":"Distrib. Comput."},{"key":"26_CR18","unstructured":"Liang, D., Shen, H.: Point sweep coverage on path. Unpublished work \nhttps:\/\/arxiv.org\/abs\/1704.04332"},{"issue":"4","key":"26_CR19","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00009181","volume":"19","author":"S-S Lin","year":"1997","unstructured":"Lin, S.-S., Lin, K.-J.: A pinwheel scheduler for three distinct numbers with a tight schedulability bound. Algorithmica 19(4), 411\u2013426 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"26_CR20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(86)90050-5","volume":"23","author":"S Ntafos","year":"1986","unstructured":"Ntafos, S.: On gallery watchmen in grids. Inf. Process. Lett. 23(2), 99\u2013102 (1986)","journal-title":"Inf. Process. Lett."},{"key":"26_CR21","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms, vol. 57. Oxford University Press, Oxford (1987)"},{"issue":"1","key":"26_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02523234","volume":"17","author":"TH Romer","year":"1997","unstructured":"Romer, T.H., Rosier, L.E.: An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling. Algorithmica 17(1), 1\u201310 (1997)","journal-title":"Algorithmica"},{"issue":"4","key":"26_CR23","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P Serafini","year":"1989","unstructured":"Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM J. Discret. Math. 2(4), 550\u2013581 (1989)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"26_CR24","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/B978-044482537-7\/50023-1","volume":"1","author":"J Urrutia","year":"2000","unstructured":"Urrutia, J.: Art gallery and illumination problems. Handbook Comput. Geom. 1(1), 973\u20131027 (2000)","journal-title":"Handbook Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2018: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73117-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T11:56:42Z","timestamp":1513857402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73117-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319731162","9783319731179"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73117-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}