Author:
Bonnet Édouard,Escoffier Bruno,Paschos Vangelis Th.,Stamoulis Georgios
Funder
Swiss National Research Foundation
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference26 articles.
1. The maximum vertex coverage problem on bipartite graphs;Apollonio;Discrete Appl. Math.,2014
2. B. Caskurlu, V. Mkrtchyan, O. Parekh, K. Subramani, On partial vertex cover and budgeted maximum coverage problems in bipartite graphs, in: Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1–3, 2014. Proceedings, 2014, pp. 13–26.
3. Approximating low-dimensional coverage problems;Badanidiyuru,2012
4. Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms;Cornuejols;Manage. Sci.,1977
5. Analysis of the greedy approach in problems of maximum k-coverage;Hochbaum;Naval Res. Logist.,1998
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献