{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:18:41Z","timestamp":1749010721811,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_26","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"319-329","source":"Crossref","is-referenced-by-count":0,"title":["The Maximum Disjoint Routing Problem"],"prefix":"10.1007","author":[{"given":"Farhad","family":"Shahmohammadi","sequence":"first","affiliation":[]},{"given":"Amir","family":"Sharif-Zadeh","sequence":"additional","affiliation":[]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"26_CR1","unstructured":"Ahmadinejad, A., Zarrabi-Zadeh, H.: The maximum disjoint set of boundary rectangles. In: Proceedings of the 26th Canadian Conference on Computational Geometry, pp. 302\u2013307 (2014)"},{"key":"26_CR2","unstructured":"Assadi, S., Emamjomeh-Zadeh, E., Yazdanbod, S., Zarrabi-Zadeh, H.: On the rectangle escape problem. In: Proceedings of the 25th Canadian Conference on Computational Geometry, pp. 235\u2013240 (2013)"},{"issue":"2","key":"26_CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1006\/jagm.1999.1054","volume":"34","author":"W-T Chan","year":"2000","unstructured":"Chan, W.-T., Chin, F.Y.: Efficient algorithms for finding the maximum number of disjoint paths in grids. J. Algorithms 34(2), 337\u2013369 (2000)","journal-title":"J. Algorithms"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Chan, W.-T., Chin, F.Y., Ting, H.-F.: A faster algorithm for finding disjoint paths in grids. In: Proceedings of the 10th International Symposium on Algorithms and Computation, pp. 393\u2013402 (1999)","DOI":"10.1007\/3-540-46632-0_40"},{"issue":"8","key":"26_CR5","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/TCAD.2007.891364","volume":"26","author":"J-W Fang","year":"2007","unstructured":"Fang, J.-W., Lin, I.-J., Chang, Y.-W., Wang, J.-H.: A network-flow-based RDL routing algorithm for flip-chip design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(8), 1417\u20131429 (2007)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Efficient breakout routing in printed circuit boards. In: Proceedings of the 7th Workshop on Algorithms and Data Structures, pp. 462\u2013471 (1997)","DOI":"10.1007\/3-540-63307-3_83"},{"key":"26_CR7","unstructured":"Keil, J.M., Mitchell, J.S., Pradhan, D., Vatshelle, M.: An algorithm for the maximum weight independent set problem on outerstring graphs. In: Proceedings of the 27th Canadian Conference on Computational Geometry, pp. 2\u20137 (2015)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kong, H., Ma, Q., Yan, T., Wong, M.D.F.: An optimal algorithm for finding disjoint rectangles and its application to PCB routing. In: Proceedings of the 47th ACM\/EDAC\/IEEE Design Automation Conference, pp. 212\u2013217 (2010)","DOI":"10.1145\/1837274.1837326"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Kong, H., Yan, T., Wong, M.D.F., Ozdal, M.M.: Optimal bus sequencing for escape routing in dense PCBs. In: Proceedings of the 2007 IEEE\/ACM International Conference on Computer-Aided Design, pp. 390\u2013395 (2007)","DOI":"10.1109\/ICCAD.2007.4397296"},{"issue":"9","key":"26_CR10","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1109\/TCAD.2012.2193581","volume":"31","author":"Q Ma","year":"2012","unstructured":"Ma, Q., Wong, M.D.F.: NP-completeness and an approximation algorithm for rectangle escape problem with application to PCB routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(9), 1356\u20131365 (2012)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Ma, Q., Young, E., Wong, M.D.F.: An optimal algorithm for layer assignment of bus escape routing on PCBs. In: Proceedings of the 48th ACM\/EDAC\/IEEE Design Automation Conference, pp. 176\u2013181 (2011)","DOI":"10.1145\/2024724.2024764"},{"issue":"1\u20134","key":"26_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic fractional cascading. Algorithmica 5(1\u20134), 215\u2013241 (1990)","journal-title":"Algorithmica"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Wu, P.-C., Ma, Q., Wong, M.D.: An ILP-based automatic bus planner for dense PCBs. In: Proceedings of the 18th Asia South Pacific Design Automation Conference, pp. 181\u2013186 (2013)","DOI":"10.1109\/ASPDAC.2013.6509593"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Yan, T., Wong, M.D.: A correct network flow model for escape routing. In: Proceedings of the 46th ACM\/EDAC\/IEEE Design Automation Conference, pp. 332\u2013335 (2009)","DOI":"10.1145\/1629911.1630001"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T02:14:26Z","timestamp":1749003266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}