Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
type: Item
instance of: scholarly article
title: Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
zbMATH Open document ID: 1184.68248
author: Andreas M. Chwatal
author: Günther R. Raidl
author: Karin Oberlechner
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2010-02-01T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5665094
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
zbMATH Keywords: GRASP
zbMATH Keywords: memetic algorithm
zbMATH Keywords: biometric template compression
zbMATH Keywords: fingerprint minutiae
zbMATH Keywords: unordered data set compression
describes a project that uses: LEDA
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10852-009-9109-1
OpenAlex ID: W2106233376
cites work: Multidimensional binary search trees used for associative searching
cites work: The minimum labeling spanning trees
cites work: On implementing the push-relabel method for the maximum flow problem
cites work: Introduction to algorithms
cites work: Greedy randomized adaptive search procedures
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: On the minimum label spanning tree problem
cites work: Q4845371
cites work: Handbook of Fingerprint Recognition
cites work: Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem
cites work: Q4862630
cites work: Design and analysis of dynamic Huffman codes
cites work: Q4943600
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
DOI: 10.1007/S10852-009-9109-1
description: scientific article; zbMATH DE number 5665094