{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:20Z","timestamp":1740099080086,"version":"3.37.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319951645"},{"type":"electronic","value":"9783319951652"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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-95165-2_43","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T10:35:04Z","timestamp":1530614104000},"page":"607-623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Yagita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"9","key":"43_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988). \nhttps:\/\/doi.org\/10.1145\/48529.48535","journal-title":"Commun. ACM"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11758471_27","volume-title":"Algorithms and Complexity","author":"Y Asahiro","year":"2006","unstructured":"Asahiro, Y., Furukawa, T., Ikegami, K., Miyano, E.: How to pack directed acyclic graphs into small blocks. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 272\u2013283. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11758471_27"},{"key":"43_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd ed. MIT Press, pp. 612\u2013615 (2009). Section 22.4: Topological sort"},{"key":"43_CR4","unstructured":"Diwan, A.A., Rane, S., Seshadri, S., Sudarshan, S.: Clustering techniques for minimizing external path length. In: Proceedings of 22nd VLDB 1996, pp. 342\u2013353 (1996)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-26626-8_25","volume-title":"Combinatorial Optimization and Applications","author":"Z Donovan","year":"2015","unstructured":"Donovan, Z., Mkrtchyan, V., Subramani, K.: On clustering without replication in combinatorial circuits. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 334\u2013347. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26626-8_25"},{"key":"43_CR6","unstructured":"Donovan, Z., Mkrtchyan, V., Subramani, K.: Complexity issues in some clustering problems in combinatorial circuits: when logic replication is not allowed. \narXiv:1412.4051v2\n\n (2017)"},{"issue":"4","key":"43_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1109\/SFCS.1975.21","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976). \nhttps:\/\/doi.org\/10.1109\/SFCS.1975.21","journal-title":"SIAM J. Comput."},{"key":"43_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"issue":"4","key":"43_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1561\/0400000014","volume":"2","author":"JS Vitter","year":"2008","unstructured":"Vitter, J.S.: Algorithms and data structures for external memory. Found. Trends Theor. Comput Sci. 2(4), 305\u2013474 (2008). \nhttps:\/\/doi.org\/10.1561\/0400000014","journal-title":"Found. Trends Theor. Comput Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95165-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T10:59:14Z","timestamp":1530615554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95165-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319951645","9783319951652"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95165-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}