Skip to main content
Conference Proceedings

Approximation algorithms for edge-covering problem

Communications in Computer and Information Science (2008) 6 CCIS 930-933
DOI: 10.1007/978-3-540-89985-3_136
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In edge-covering problem the goal is finding the minimum number of guards to cover the edges of a simple polygon. This problem is NP-hard, and to our knowledge there is just one approximation algorithm for a restricted case of this problem. In this paper we present two approximation algorithms for two versions of this problem. © 2008 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Hosseinzadeh Moghaddam, M., & Bagheri, A. (2008). Approximation algorithms for edge-covering problem. In Communications in Computer and Information Science (Vol. 6 CCIS, pp. 930–933). https://doi.org/10.1007/978-3-540-89985-3_136

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free