{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:38:15Z","timestamp":1760888295300},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00453-008-9252-5","type":"journal-article","created":{"date-parts":[[2008,11,17]],"date-time":"2008-11-17T11:17:26Z","timestamp":1226920646000},"page":"583-596","source":"Crossref","is-referenced-by-count":3,"title":["Multiline Addressing by Network Flow"],"prefix":"10.1007","volume":"53","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Karrenbauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chihao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,18]]},"reference":[{"key":"9252_CR1","unstructured":"Xu, C., Wahl, J., Eisenbrand, F., Karrenbauer, A., Soh, K.M., Hitzelberger, C.: Method for triggering matrix displays. German Patent Application 10 2005 063 159 PCT\/EP2006\/012362 (filed 12\/30\/2005, pending)"},{"key":"9252_CR2","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol.\u00a02. Springer, Berlin (1988)"},{"key":"9252_CR3","first-page":"1093","volume":"244","author":"L. Khachiyan","year":"1979","unstructured":"Khachiyan, L.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 1093\u20131097 (1979)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9252_CR4","first-page":"393","volume":"2","author":"G. Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2, 393\u2013410 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"key":"9252_CR5","doi-asserted-by":"crossref","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems, FOCS pp.\u00a0300\u2013309 (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"key":"9252_CR6","doi-asserted-by":"crossref","unstructured":"Xu, C., Karrenbauer, A., Soh, K.M., Wahl, J.: A new addressing scheme for PM OLED display. In: Morreale, J. (ed.) SID 2007 International Symposium Digest of Technical Papers. Society for Information Display, vol.\u00a0XXXVIII, pp.\u00a097\u2013100. Long Beach, USA (2007)","DOI":"10.1889\/1.2785235"},{"key":"9252_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-540-72845-0_26","volume-title":"WEA 2007","author":"F. Eisenbrand","year":"2007","unstructured":"Eisenbrand, F., Karrenbauer, A., Xu, C.: Algorithms for longer OLED lifetime. In: Demetrescu, C. (ed.) WEA 2007. Lecture Notes in Computer Science, vol.\u00a04525, pp.\u00a0338\u2013351. Springer, Berlin (2007)"},{"key":"9252_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P. Paatero","year":"1994","unstructured":"Paatero, P., Tapper, U.: Positive matrix factorization: A\u00a0non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5, 111\u2013126 (1994)","journal-title":"Environmetrics"},{"key":"9252_CR9","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization, Adv. Neural Inf. Process. Syst. 13 (2001)"},{"key":"9252_CR10","unstructured":"Smith, E., Routley, P., Foden, C.: Processing digital data using non-negative matrix factorization. Patent GB 2421604A, pending (2005)"},{"key":"9252_CR11","doi-asserted-by":"crossref","unstructured":"Smith, E.C.: Total matrix addressing (TMA\u2122). In: Morreale, J. (ed.) SID 2007 International Symposium Digest of Technical Papers. Society for Information Display, vol.\u00a0XXXVIII, pp.\u00a093\u201396. Long Beach, USA (2007)","DOI":"10.1889\/1.2785234"},{"key":"9252_CR12","doi-asserted-by":"crossref","unstructured":"Ehrgott, M., Hamacher, H.W., Nu\u00dfbaum, M.: Decomposition of matrices and static multileaf collimators: a survey, vol.\u00a012, pp.\u00a025\u201346 (2007)","DOI":"10.1007\/978-0-387-73299-2_2"},{"key":"9252_CR13","doi-asserted-by":"crossref","unstructured":"Murano, S., Burghart, M., Birnstock, J., Wellmann, P., Vehse, M., Werner, A., Canzler, T., St\u00fcbinger, T., He, G., Pfeiffer, M., Boerner, H.: Highly efficient white OLEDs for lighting applications. SPIE, San Diego (2005)","DOI":"10.1117\/12.614075"},{"key":"9252_CR14","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"9252_CR15","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization\u2014Polyhedra and Efficiency. Algorithms and Combinatorics, vol.\u00a024. Springer, Berlin (2003)"},{"issue":"2","key":"9252_CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9252-5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:54:29Z","timestamp":1557914069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9252-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,18]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9252"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9252-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,18]]}}}