Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A Greedy Approximation Algorithm For The Uniform Labeling Problem Analyzed By A Primal-dual Technique
Author: Bracht E.C.
Meira L.A.A.
Miyazawa F.K.
Abstract: In this paper we present a new fast approximation algorithm for the Uniform Metric Labeling Problem. This is an important classification problem that occur in many applications which consider the assignment of objects into labels, in a way that is consistent with some observed data that includes the relationship between the objects. The known approximation algorithms are based on solutions of large linear programs and are impractical for moderated and large size instances. We present an 8 log n-approximation algorithm analyzed by a primal-dual technique which, although has factor greater than the previous algorithms, can be applied to large sized instances. We obtained experimental results on computational generated and image processing instances with the new algorithm and two others LP-based approximation algorithms. For these instances our algorithm present a considerable gain of computational time and the error ratio, when possible to compare, was less than 2% from the optimum. © Springer-Verlag 2004.
Rights: fechado
Identifier DOI: 
Date Issue: 2004
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.