{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:14:54Z","timestamp":1761894894000},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T00:00:00Z","timestamp":1240272000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10852-009-9109-1","type":"journal-article","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T04:35:50Z","timestamp":1240202150000},"page":"293-334","source":"Crossref","is-referenced-by-count":6,"title":["Solving a k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates"],"prefix":"10.1007","volume":"8","author":[{"given":"Andreas M.","family":"Chwatal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karin","family":"Oberlechner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,21]]},"reference":[{"issue":"9","key":"9109_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"9109_CR2","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report 124, Digital SRC Research Report (1994)"},{"issue":"5","key":"9109_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"R-S Chang","year":"1997","unstructured":"Chang, R.-S., Leu, S.-J.: The minimum labeling spanning trees. Inf. Process. Lett. 63(5), 277\u2013282 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9109_CR4","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"BV Cherkassky","year":"1997","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 390\u2013410 (1997)","journal-title":"Algorithmica"},{"key":"9109_CR5","unstructured":"Chwatal, A.M., Raidl, G.R.: Applying branch-and-cut for compressing fingerprint templates (short abstract). In: Proceedings of the European Conference on Operational Research (EURO) XXII, Prague (2007)"},{"key":"9109_CR6","unstructured":"Chwatal, A.M., Raidl, G.R., Dietzel, O.: Compressing fingerprint templates by solving an extended minimum label spanning tree problem. In: Proceedings of the Seventh Metaheuristics International Conference (MIC), Montreal (2007)"},{"key":"9109_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT, Cambridge (2001)","edition":"2"},{"key":"9109_CR8","unstructured":"Dietzel, O.: Combinatorial optimization for the compression of biometric templates. Master\u2019s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (2008)"},{"key":"9109_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9109_CR10","doi-asserted-by":"crossref","unstructured":"Garris, M.D., McCabe, R.M.: NIST special database 27: fingerprint minutiae from latent and matching tenprint images. Technical report, National Institute of Standards and Technology (2000)","DOI":"10.6028\/NIST.IR.6534"},{"issue":"1","key":"9109_CR11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. J. ACM 32(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"9109_CR12","unstructured":"ILOG Concert Technology, CPLEX: ILOG. http:\/\/www.ilog.com . Version 11.0 (2009)"},{"key":"9109_CR13","unstructured":"Jain, A., Uludag, U.: Hiding fingerprint minutiae in images. In: Proceedings of Third Workshop on Automatic Identification Advanced Technologies, pp. 97\u2013102 (2002)"},{"issue":"2","key":"9109_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"SO Krumke","year":"1998","unstructured":"Krumke, S.O., Wirth, H.-C.: On the minimum label spanning tree problem. Inf. Process. Lett. 66(2), 81\u201385 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9109_CR15","unstructured":"Library for Efficient Datastructures and Algorithms (LEDA): Algorithmics Solutions Software GmbH. http:\/\/www.algorithmic-solutions.com\/ . Version 5.1 (2009)"},{"key":"9109_CR16","first-page":"503","volume-title":"Network Models. Handbook in Operations Research and Management Science","author":"T Magnanti","year":"1995","unstructured":"Magnanti, T., Wolsey, L.: Optimal trees. In: Network Models. Handbook in Operations Research and Management Science, pp. 503\u2013615. North Holland, Amsterdam (1995)"},{"key":"9109_CR17","volume-title":"Handbook of Fingerprint Recognition","author":"D Maltoni","year":"2003","unstructured":"Maltoni, D., Maio, D., Jain, A.K., Prabhakar, S.: Handbook of Fingerprint Recognition. Springer, New York (2003)"},{"issue":"3","key":"9109_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/290159.290162","volume":"16","author":"A Moffat","year":"1998","unstructured":"Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic coding revisited. ACM Trans. Inf. Sys. 16(3), 256\u2013294 (1998)","journal-title":"ACM Trans. Inf. Sys."},{"key":"9109_CR19","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/1143997.1144097","volume-title":"GECCO \u201906: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation","author":"J Nummela","year":"2006","unstructured":"Nummela, J., Julstrom, B.A.: An effective genetic algorithm for the minimum-label spanning tree problem. In: GECCO \u201906: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 553\u2013558. ACM, New York (2006)"},{"key":"9109_CR20","series-title":"AIP Conference Proceedings","first-page":"444","volume-title":"Numerical Analysis and Applied Mathematics","author":"GR Raidl","year":"2007","unstructured":"Raidl, G.R., Chwatal, A.: Fingerprint template compression by solving a minimum label k-node subtree problem. In: Simos, E. (ed.) Numerical Analysis and Applied Mathematics. AIP Conference Proceedings, vol. 936, pp. 444\u2013447. American Institute of Physics, New York (2007)","edition":"936"},{"key":"9109_CR21","doi-asserted-by":"crossref","unstructured":"Saleh, A., Adhami, R.: Curvature-based matching approach for automatic fingerprint identification. In: Proceedings of the Southeastern Symposium on System Theory, pp. 171\u2013175 (2001)","DOI":"10.1109\/SSST.2001.918512"},{"key":"9109_CR22","volume-title":"Introduction to Data Compression","author":"K Sayood","year":"2006","unstructured":"Sayood, K.: Introduction to Data Compression, 3rd edn. Morgan Kaufmann, San Mateo (2006)","edition":"3"},{"key":"9109_CR23","doi-asserted-by":"crossref","unstructured":"Varshney, L.R., Goyal, V.K.: Benefiting from disorder: source coding for unordered data. arXiv, abs\/0708.2310 (2007)","DOI":"10.1109\/ITA.2007.4357578"},{"issue":"4","key":"9109_CR24","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"JS Vitter","year":"1987","unstructured":"Vitter, J.S.: Design and analysis of dynamic huffman codes. J. ACM 34(4), 825\u2013845 (1987)","journal-title":"J. ACM"},{"key":"9109_CR25","volume-title":"Integer and Combinatorial Optimization","author":"LA Wolsey","year":"1999","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1999)"},{"issue":"1","key":"9109_CR26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TEVC.2004.840145","volume":"9","author":"Y Xiong","year":"2005","unstructured":"Xiong, Y., Golden, B., Wasil, E.: A one-parameter genetic algorithm for the minimum labeling spanning tree problem. IEEE Trans. Evol. Comput. 9(1), 55\u201360, 2 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"9109_CR27","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"9109_CR28","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-009-9109-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-009-9109-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-009-9109-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:31Z","timestamp":1559255191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-009-9109-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,21]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9109"],"URL":"https:\/\/doi.org\/10.1007\/s10852-009-9109-1","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,21]]}}}