Approximating Visibility Problems within a Constant

@inproceedings{ARKOU2006ApproximatingVP,
  title={Approximating Visibility Problems within a Constant},
  author={E. M ARKOU},
  year={2006}
}
  • E. M ARKOU
  • Published 2006
Visibility problems deal with placing a minimum number of tr ansmitting stations in a region thus covering a maximum number of co mmunication needs. Here we investigate some variants of such proble ms e.g. i) given a polygonP with weights on the vertices find at most k convex subpolygonsCi of P (possibly overlapping) withV(Ci) ⊆ V(P) so that the weight of the vertices is a maximum, and ii) given a polygon (possibl y with holes) andk available vertex (or edge) guards maximize a) the length of… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Computational complexity of art gallery problems

IEEE Trans. Information Theory • 1986
View 11 Excerpts
Highly Influenced

Approximating Covering and Packing Prob lems in: Approximation Algorithms for NP-Hard Problems (ed

D. Hochbaum
Dorit Hochbau m), • 1996
View 1 Excerpt

Approximation Algorithms for NP-Hard Pr oblems

D. Hochbaum
PWS Publishing Company, • 1996

Recent results in Art Galleries

T. Shermer
Proc. of th e IEEE, • 1992
View 1 Excerpt

Similar Papers

Loading similar papers…