{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:15:32Z","timestamp":1742933732982,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_11","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"123-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Polygon Burning Problem"],"prefix":"10.1007","author":[{"given":"William","family":"Evans","sequence":"first","affiliation":[]},{"given":"Rebecca","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s00454-016-9796-0","volume":"56","author":"HK Ahn","year":"2016","unstructured":"Ahn, H.K., Barba, L., Bose, P., De Carufel, J.L., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon. Discrete Comput. Geom. 56(4), 836\u2013859 (2016)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. In: Johnson, D.S., Nishizeki, T., Nozaki, A., Wilf, H.S. (eds.) Discrete Algorithms and Complexity, pp. 65\u201379. Academic Press (1987)","DOI":"10.1016\/B978-0-12-386870-1.50010-1"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10878-012-9532-5","volume":"27","author":"H Du","year":"2014","unstructured":"Du, H., Xu, Y.: An approximation algorithm for $$k$$-center problem on a convex polygon. J. Combin. Optim. 27(3), 504\u2013518 (2014)","journal-title":"J. Combin. Optim."},{"key":"11_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"LJ Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-68880-8_20","volume-title":"Algorithmic Aspects in Information and Management","author":"H Guo","year":"2008","unstructured":"Guo, H., Maheshwari, A., Sack, J.-R.: Shortest path queries in polygonal domains. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 200\u2013211. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68880-8_20"},{"key":"11_CR9","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D Hochbaum","year":"1995","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1995)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the $$k$$-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: the $$p$$-centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)","DOI":"10.1137\/0137040"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.comgeo.2018.02.008","volume":"74","author":"E Oh","year":"2018","unstructured":"Oh, E., De Carufel, J.L., Ahn, H.K.: The geodesic 2-center problem in a simple polygon. Comput. Geom. 74, 21\u201337 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2018.02.008","journal-title":"Comput. Geom."},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Oh, E., Son, W., Ahn, H.K.: Constrained geodesic centers of a simple polygon. In: 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), vol. 53, pp. 29:1\u201329:13 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2016.29","DOI":"10.4230\/LIPIcs.SWAT.2016.29"},{"issue":"6","key":"11_CR14","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/BF02187751","volume":"4","author":"R Pollack","year":"1989","unstructured":"Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(6), 611\u2013626 (1989). https:\/\/doi.org\/10.1007\/BF02187751","journal-title":"Discrete Comput. Geom."},{"issue":"9","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Trans. Circ. Syst. 36(9), 1230\u20131234 (1989)","journal-title":"IEEE Trans. Circ. Syst."},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Wang, H.: On the geodesic centers of polygonal domains. In: 24th Annual European Symposium on Algorithms (ESA 2016), vol. 57, pp. 77:1\u201377:17 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2016.77","DOI":"10.4230\/LIPIcs.ESA.2016.77"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:04:57Z","timestamp":1647389097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}