Author:
Ashur Stav,Filtser Omrit,Katz Matthew J.,Saban Rachel
Publisher
Springer International Publishing
Reference19 articles.
1. Ahmed, A.R., et al.: L-graphs and monotone L-graphs.
arXiv:1703.01544
(2017)
2. Bandyapadhyay, S., Maheshwari, A., Mehrabi, S., Suri, S.: Approximating dominating set on intersection graphs of rectangles and L-frames. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, 27–31 August 2018, Liverpool, UK, pp. 37:1–37:15 (2018).
https://doi.org/10.4230/LIPIcs.MFCS.2018.37
3. Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: A constant-factor approximation algorithm for optimal 1.5D terrain guarding. SIAM J. Comput. 36(6), 1631–1647 (2007)
4. Bhattacharya, P., Ghosh, S.K., Pal, S.: Constant approximation algorithms for guarding simple polygons using vertex guards.
arXiv:1712.05492
(2017)
5. Bhattacharya, P., Ghosh, S.K., Roy, B.: Approximability of guarding weak visibility polygons. Discrete Appl. Math. 228, 109–129 (2017)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献