Results 1 -
2 of
2
A greedy approximation algorithm for the uniform labeling problem analysed by a primal dual technique
- In Proc. of 3rd Workshop on Efficient and Experimental Algorithms, WEA04, LNCS 3059
, 2004
"... We consider the uniform metric labeling problem. This NP-hard problem considers how to assign objects to labels respecting assignment and separation costs. The known approximation algorithms are based on solutions of large linear programs and are impractical for moderate- and large-size instances. W ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
We consider the uniform metric labeling problem. This NP-hard problem considers how to assign objects to labels respecting assignment and separation costs. The known approximation algorithms are based on solutions of large linear programs and are impractical for moderate- and large-size instances. We present an 8 log n-approximation algorithm that can be applied to large-size instances. The algorithm is greedy and is analyzed by a primal-dual technique. We implemented the presented algorithm and two known approximation algorithms and compared them at randomized instances. The gain of time was considerable with small error ratios. We also show that the analysis is tight, up to a constant factor.
