{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:32:48Z","timestamp":1745976768016,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/ispan.2004.1300488","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T10:19:45Z","timestamp":1086862785000},"page":"247-253","source":"Crossref","is-referenced-by-count":15,"title":["Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem"],"prefix":"10.1109","author":[{"family":"Sung Eun Bae","sequence":"first","affiliation":[]},{"family":"Tadao Takaoka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"356","article-title":"An algorithm for finding k shortest loopless paths in a directed network","volume":"26","author":"sugimoto","year":"1985","journal-title":"Trans Information Processing Soc Japan"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/S1571-0661(04)00313-5"},{"key":"ref12","first-page":"446","article-title":"Algorithms for the maximum subarray problem based on matrix multiplication","author":"tamaki","year":"1998","journal-title":"Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/0167-8191(94)00063-G"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1968.381154"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/358234.381162"},{"year":"0","author":"jodrey","article-title":"Parallel maximum sum algorithms on interconnection networks","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/SFCS.1994.365697"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1002\/net.3230120406"},{"key":"ref7","first-page":"971","article-title":"An $o(kn^{2})$ algorithm for k shortest simple paths in an undirected graph with nonnegative arc length","volume":"e61","author":"katoh","year":"1978","journal-title":"IEICE Transactions on Information &Systems"},{"key":"ref2","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"batcher","year":"1968","journal-title":"Proc 4FIPS FJCC"},{"key":"ref1","first-page":"94","article-title":"Parallel approaches to the maximum subarray problem","author":"bae","year":"2003","journal-title":"Proceedings of the Japan-Korea Workshop on Algorithms and Computation"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1142\/S0129626495000345"}],"event":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","start":{"date-parts":[[2004,5,12]]},"location":"Hong Kong, China","end":{"date-parts":[[2004,5,12]]}},"container-title":["7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9103\/28881\/01300488.pdf?arnumber=1300488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T17:06:18Z","timestamp":1489424778000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1300488\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ispan.2004.1300488","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}