article

A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique

Authors:

Evandro C. Bracht,

Luis A. A. Meira,

F. K. MiyazawaAuthors Info & Claims

Journal of Experimental Algorithmics (JEA), Volume 10

Pages 2.11 - es

https://doi.org/10.1145/1064546.1180623

Published: 31 December 2005 Publication History

Abstract

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 8log 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.

References

[1]

Besag, J. 1974. Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society B36, 2, 192--236.

[2]

Besag, J. 1986. On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society B48, 3, 259--302.

[3]

Bracht, Evandro C., Meira Luis, A. A., and Miyazawa, F. K. 2002. Instances and programs to Uniform Metric Labeling Problem. http://www.ic.unicamp.br/~aprox/labeling.

[4]

Chakrabarti, S., Dom, B., and Indyk, P. 1998. Enhanced hypertext categorization using hyperlinks. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 307--318.

Digital Library

[5]

Chekuri, C., Khanna, S., Naor, J. S., and Zosin, L. 2001. Approximation algorithms for the metric labeling problem via a new linear programming formulation. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 109--118.

Digital Library

[6]

Chvátal, V. 1979. A greedy heuristic for the set-covering problem. Math. of Oper. Res. 4, 3, 233--235.

Digital Library

[7]

Cohen, F. S. 1986. Markov random fields for image modelling and analysis. Modelling and Applications of Stochastic Processes. 243--272.

Digital Library

[8]

Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., and Yannakakis, M. 1994. The complexity of multiterminal cuts. SIAM Journal on Computing 23, 4, 864--894.

Digital Library

[9]

Dash Optimization. 2002. Xpress-MP Manual. Release 13.

[10]

Dubes, R. C. and Jain, A. K. 1989. Random field models in image analysis. Journal of Applied Statistics 16.

[11]

Freivalds, K. 2003. A nondifferentiable optimization approach to ratio-cut partitioning. In Proceedings of the 2nd Workshop on Efficient and Experimental Algorithms. Lectures Notes on Computer Science, vol. 2647. Springer-Verlag, New York.

Digital Library

[12]

Gupta, A. and Tardos, E. 2000. A constant factor approximation algorithm for a class of classification problems. In Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing. 652--658.

Digital Library

[13]

Jain, K., Mahdian, M., Markakis, E., Saberi, A., and Vazirani, V. 2003. Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. Journal of the ACM (JACM) 50, 6 (Nov.), 795--824.

Digital Library

[14]

Kleinberg, J. and Tardos, E. 1999. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and markov random fields. In Proceedings of the 40th Annuall IEEE Symposium on Foundations of Computer Science. 14--23.

Digital Library

[15]

Vazirani, V. 2001. Approximation Algorithms. Springer-Verlag, New York.

Digital Library

Cited By

Armenatzoglou NPham HNtranos VPapadias DShahabi CSellis TDavidson SIves Z(2015)Real-Time Multi-Criteria Social Graph PartitioningProceedings of the 2015 ACM SIGMOD International Conference on Management of Data10.1145/2723372.2749450(1617-1628)Online publication date: 27-May-2015
https://dl.acm.org/doi/10.1145/2723372.2749450
Meira LMiyazawa F(2011)Semidefinite Programming Based Algorithms for the Sparsest Cut ProblemRAIRO - Operations Research10.1051/ro/201110445:2(75-100)Online publication date: 17-Jun-2011
https://doi.org/10.1051/ro/2011104

Index Terms

A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph enumeration
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Population-based iterated greedy algorithm for the S-labeling problem
Abstract
The iterated greedy metaheuristic generates a sequence of solutions by iterating over a constructive heuristic using destruction and construction phases. In the last few years, it has been employed to solve a considerable number of ...
Highlights
- A population-based iterated greedy (PIG) for solving the S-labeling problem is introduced.
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

In the weighted set-cover problem we are given a set of elements $E=\{ e_1,e_2, \ldots ,e_n \}$ and a collection $\cal F$ of subsets of $E$, where each $S \in \cal F$ has a positive cost $c_{S}$. The problem is to compute a subcollection $SOL$ such that ...
Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search

In the unweighted set cover problem we are given a set of elements $E=\{e_1,e_2,\ldots,e_n\}$ and a collection ${\cal F}$ of subsets of $E$. The problem is to compute a subcollection $SOL\subseteq{\cal F}$ such that $\bigcup_{S_j\in SOL}S_j=E$ and its ...

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics

ACM Journal of Experimental Algorithmics Volume 10, Issue

2005

291 pages

ISSN:1084-6654

EISSN:1084-6654

DOI:10.1145/1064546

Issue’s Table of Contents

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 December 2005

Published in JEA Volume 10

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
410
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Armenatzoglou NPham HNtranos VPapadias DShahabi CSellis TDavidson SIves Z(2015)Real-Time Multi-Criteria Social Graph PartitioningProceedings of the 2015 ACM SIGMOD International Conference on Management of Data10.1145/2723372.2749450(1617-1628)Online publication date: 27-May-2015
https://dl.acm.org/doi/10.1145/2723372.2749450
Meira LMiyazawa F(2011)Semidefinite Programming Based Algorithms for the Sparsest Cut ProblemRAIRO - Operations Research10.1051/ro/201110445:2(75-100)Online publication date: 17-Jun-2011
https://doi.org/10.1051/ro/2011104

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents