{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:38:41Z","timestamp":1743025121959,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031069000"},{"type":"electronic","value":"9783031069017"}],"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-031-06901-7_2","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"15-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing"],"prefix":"10.1007","author":[{"given":"Markus","family":"Ahrens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothee","family":"Henke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Rabenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Vygen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Ahrens, M., Henke, D., Rabenstein, S., Vygen, J.: Faster goal-oriented shortest path search for bulk and incremental detailed routing. arXiv:2111.06169 (2021)","DOI":"10.1007\/978-3-031-06901-7_2"},{"key":"2_CR2","unstructured":"Ahrens, M.: Efficient algorithms for routing a net subject to VLSI design rules. Ph.D. thesis, University of Bonn (2020)"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TCAD.2014.2385755","volume":"34","author":"M Ahrens","year":"2015","unstructured":"Ahrens, M., et al.: Detailed routing algorithms for advanced technology nodes. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(4), 563\u2013576 (2015)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"2_CR4","doi-asserted-by":"publisher","DOI":"10.1201\/9781420013481","volume-title":"Handbook of Algorithms for Physical Design Automation","author":"CJ Alpert","year":"2008","unstructured":"Alpert, C.J., Mehta, D.P., Sapatnekar, S.S.: Handbook of Algorithms for Physical Design Automation. CRC Press, Boca Raton (2008)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Batterywala, S., Shenoy, N., Nicholls, W., Zhou, H.: Track assignment: a desirable intermediate step between global routing and detailed routing. In: Proceedings of the 2002 IEEE\/ACM International Conference on Computer-Aided Design, pp. 59\u201366 (2002)","DOI":"10.1145\/774572.774581"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Guibas, L., Stolfi, J.: Optimal point location in a monotone subdivision. SIAM J. Comput. 15(2), 317\u2013340 (1986)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2442087.2442103","volume":"18","author":"M Gester","year":"2013","unstructured":"Gester, M., M\u00fcller, D., Nieberg, T., Panten, C., Schulte, C., Vygen, J.: BonnRoute: algorithms and data structures for fast and good VLSI routing. ACM Trans. Des. Autom. Electron. Syst. 18(2), 1\u201324 (2013)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TCAD.2017.2697964","volume":"37","author":"S Held","year":"2018","unstructured":"Held, S., M\u00fcller, D., Rotter, D., Scheifele, R., Traub, V., Vygen, J.: Global routing with timing constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(2), 406\u2013419 (2018)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"2_CR11","unstructured":"Hetzel, A.: A sequential detailed router for huge grid graphs. In: Proceedings of Design, Automation and Test in Europe, pp. 332\u2013338. IEEE (1998)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"2_CR13","unstructured":"Klewinghaus, N.: Efficient detailed routing on optimized tracks. Ph.D. thesis, University of Bonn (2022)"},{"key":"2_CR14","unstructured":"Lawler, E., Luby, M., Parker, B.: Finding shortest paths in very large networks. In: Nagl, M., Perl, J. (eds.) Proceedings of Graph-Theoretic Concepts in Computer Science. Trauner, Linz (1983)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Lipton, H.J., Tarjan, R.E.: Applications of a planar separator theorem. In: 18th Annual IEEE Symposium on Foundations of Computer Science, pp. 162\u2013170 (1977)","DOI":"10.1109\/SFCS.1977.6"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-011-0023-y","volume":"3","author":"D M\u00fcller","year":"2011","unstructured":"M\u00fcller, D., Radke, K., Vygen, J.: Faster min-max resource sharing in theory and practice. Math. Program. Comput. 3(1), 1\u201335 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0023-y","journal-title":"Math. Program. Comput."},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.jda.2007.08.003","volume":"7","author":"S Peyer","year":"2009","unstructured":"Peyer, S., Rautenbach, D., Vygen, J.: A generalization of Dijkstra\u2019s shortest path algorithm with applications to VLSI routing. J. Discrete Algorithms 7(4), 377\u2013390 (2009)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(79)90055-0","volume":"8","author":"FP Preparata","year":"1979","unstructured":"Preparata, F.P., M\u00fcller, D.E.: Finding the intersection of n half-spaces in time $$O(n \\log n)$$. Theoret. Comput. Sci. 8(1), 45\u201355 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1109\/T-C.1974.224054","volume":"23","author":"F Rubin","year":"1974","unstructured":"Rubin, F.: The Lee path connection algorithm. IEEE Trans. Comput. 23, 907\u2013914 (1974)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"2_CR20","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.: Planar point location using persistent search trees. Commun. ACM 29(7), 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1142\/S0218195994000057","volume":"4","author":"M Sarrafzadeh","year":"1994","unstructured":"Sarrafzadeh, M., Lee, D.T.: Restricted track assignment with applications. Int. J. Comput. Geom. Appl. 4(1), 53\u201368 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Tellez, G., Hu, J., Wei, Y.: Routing. In: Lavagno, L., Markov, I.L., Martin, G., Scheffer, L.K. (eds.) Electronic Design Automation for IC Implementation, Circuit Design, and Process Technology. CRC Press (2016)","DOI":"10.1201\/b19714-10"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06901-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T23:02:42Z","timestamp":1653951762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_2","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":"27 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/home","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":"93","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":"33","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":"35% - 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":"33","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)"}}]}}