A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation algorithms for maximization problems arising in graph partitioning
Journal of Algorithms
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The quadratic 0-1 knapsack problem with series-parallel support
Operations Research Letters
| Hi-index | 0.00 |
We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset A ⊆ V, such that |A| = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memory; if at some point the current solution already contains V vertices, any inclusion of a new vertex in the solution must entail the definite deletion of another vertex of the current solution (a vertex not kept when revealed is definitely deleted). We propose algorithms for several natural classes of graphs (mainly regular and bipartite), improving on an easy 1/2-competitive ratio. We next settle a set-version of the problem, called maximum k-(set)-coverage problem. For this problem we present an algorithm that improves upon former results for the same model for small and moderate values of k.