by Corinna Thöni
Reference:
Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-PriceCorinna ThöniFeb 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl and A. Chwatal
Bibtex Entry:
@mastersthesis{thoeni-10,
author = {Corinna Th{\"o}ni},
title = {Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price},
school = {Vienna University of Technology, Institute of
Computer Graphics and Algorithms},
year = {2010},
month = Feb,
note = {supervised by G.~Raidl and A.~Chwatal},
keywords = {netdesign},
url = {https://www.ac.tuwien.ac.at/files/pub/thoeni-10.pdf},
}