The maximum k-colorable subgraph problem for chordal graphs
Information Processing Letters
Integer and combinatorial optimization
Integer and combinatorial optimization
The complexity of generalized clique covering
Discrete Applied Mathematics
Minimax relations for the partial q-colorings of a graph
Discrete Mathematics - Graph colouring and variations
A min-max relation for the partial q-colourings of a graph. Part II: box perfection
Discrete Mathematics - Graph colouring and variations
Handbook of combinatorics (vol. 1)
Approximation algorithms for NP-hard problems
Maximum h-colourable subgraph problem in balanced graphs
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Maximum Covering with D Cliques
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
On the densest k-subgraph problems
On the densest k-subgraph problems
(p, k)-coloring problems in line graphs
Theoretical Computer Science
Minmax relations for cyclically ordered digraphs
Journal of Combinatorial Theory Series B
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Minconvex Factors of Prescribed Size in Graphs
SIAM Journal on Discrete Mathematics
Note: Recognizing Helly Edge-Path-Tree graphs and their clique graphs
Discrete Applied Mathematics
Improved approximation of maximum vertex cover
Operations Research Letters
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
| Hi-index | 0.04 |
Given a simple undirected graph G and a positive integer s the Maximum Vertex Coverage Problem is the problem of finding a set U of s vertices of G such that the number of edges having at least one endpoint in U is as large as possible. We prove that the Maximum Vertex Coverage problem on bipartite graphs is NP-hard and discuss several consequences related to known combinatorial optimization problems.