{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:23:56Z","timestamp":1743081836836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030750039"},{"type":"electronic","value":"9783030750046"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-75004-6_7","type":"book-chapter","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T23:09:48Z","timestamp":1621379388000},"page":"84-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FttX Deployment Using Available Networks and Existing Infrastructures"],"prefix":"10.1007","author":[{"given":"Niels M. P.","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Frank","family":"Phillipson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Agarwal, P., Sharir, M.: Red-blue intersection detection algorithms, with applications to motion planning and collision detection. Association for Computing Machinery, New York, NY, USA (1988). https:\/\/doi.org\/10.1145\/73393.73401. ISBN 0897912705","key":"7_CR1","DOI":"10.1145\/73393.73401"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-87744-8_8","volume-title":"Algorithms - ESA 2008","author":"L Arge","year":"2008","unstructured":"Arge, L., M\u00f8lhave, T., Zeh, N.: Cache-oblivious red-blue line segment intersection. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 88\u201399. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_8"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87\u201390 (1958). http:\/\/www.jstor.org\/stable\/43634538. ISSN 0033569X","journal-title":"Q. Appl. Math."},{"issue":"9","key":"7_CR4","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/tc.1979.1675432","volume":"C\u201328","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C\u201328(9), 643\u2013647 (1979). https:\/\/doi.org\/10.1109\/tc.1979.1675432","journal-title":"IEEE Trans. Comput."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"key":"7_CR6","volume-title":"Network Flow Theory","author":"LR Ford","year":"1956","unstructured":"Ford, L.R.: Network Flow Theory. RAND Corporation, Santa Monica (1956)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.scs.2017.07.012","volume":"35","author":"M Khan","year":"2017","unstructured":"Khan, M., Babar, M., Ahmed, S.H., Shah, S.C., Han, K.: Smart city designing and planning based on big data analytics. Sustain. Cities Soc. 35, 271\u2013279 (2017). https:\/\/doi.org\/10.1016\/j.scs.2017.07.012","journal-title":"Sustain. Cities Soc."},{"doi-asserted-by":"publisher","unstructured":"Mantler, A.: Intersecting red and blue line segments in optimal time and precision (2001). https:\/\/doi.org\/10.14288\/1.0051494","key":"7_CR8","DOI":"10.14288\/1.0051494"},{"key":"7_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-60447-3_8","volume-title":"Innovations for Community Services","author":"N Neumann","year":"2017","unstructured":"Neumann, N., Phillipson, F.: Finding the intersection points of networks. In: Eichler, G., Erfurth, C., Fahrnberger, G. (eds.) I4CS 2017. CCIS, vol. 717, pp. 104\u2013118. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60447-3_8"},{"doi-asserted-by":"publisher","unstructured":"Phillipson, F.: Efficient algorithms for infrastructure networks: Planning issues and economic impact (2014). https:\/\/doi.org\/10.13140\/2.1.3025.1844","key":"7_CR10","DOI":"10.13140\/2.1.3025.1844"},{"doi-asserted-by":"publisher","unstructured":"Phillipson, F.: Planning of fibre to the curb using G. Fast in multiple roll-out scenarios. In: LNIT, vol. 2, issue 1, pp. 42\u201349 (2014). https:\/\/doi.org\/10.12720\/lnit.2.1.42-49","key":"7_CR11","DOI":"10.12720\/lnit.2.1.42-49"},{"doi-asserted-by":"publisher","unstructured":"Phillipson, F.: Roll-out of reliable fiber to the cabinet: an interactive planning approach. J. Opt. Commun. Netw. 6(8), 705 (2014). https:\/\/doi.org\/10.1364\/jocn.6.000705","key":"7_CR12","DOI":"10.1364\/jocn.6.000705"},{"unstructured":"Phillipson, F., Vos, T.: Dense multi-service planning in smart cities. In: 2018 Proceedings of International Conference on Information Society and Smart Cities, p. 11 (2018)","key":"7_CR13"},{"doi-asserted-by":"publisher","unstructured":"Shamos, M.I., Hoey, D.: Closest-point problems. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, USA (1975). IEEE Computer Society. https:\/\/doi.org\/10.1109\/SFCS.1975.8","key":"7_CR14","DOI":"10.1109\/SFCS.1975.8"},{"doi-asserted-by":"publisher","unstructured":"Shamos, M.I., Hoey, D.: Geometric intersection problems. In: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, SFCS 1976, pp. 208\u2013215, USA. IEEE Computer Society (1976). https:\/\/doi.org\/10.1109\/SFCS.1976.16","key":"7_CR15","DOI":"10.1109\/SFCS.1976.16"}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75004-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T23:10:06Z","timestamp":1621379406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75004-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030750039","9783030750046"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75004-6_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations for Community Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bamberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i4cs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i4cs-conference.org\/","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":"43","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":"14","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":"2","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":"33% - 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.56","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":"5.88","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":"1 short invited paper is also included.","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)"}}]}}