The maximum vertex coverage problem on bipartite graphs
Authors:
- Nicola ApollonioNANicola Apollonio
- Bruno SimeoneBSBruno Simeone
- 1 March 2014
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 165, 37-48
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Recognizing Helly Edge-Path-Tree graphs and their clique graphsDiscrete Applied Mathematics, 2011
- Maximizing a Monotone Submodular Function Subject to a Matroid ConstraintSIAM Journal on Computing, 2011
- Minconvex Factors of Prescribed Size in GraphsSIAM Journal on Discrete Mathematics, 2009
- Maximum h-colourable subgraph problem in balanced graphsInformation Processing Letters, 1998
- A min-max relation for the partial q- colourings of a graph. Part II: Box perfectionDiscrete Mathematics, 1989
- Minimax relations for the partial q- colorings of a graphDiscrete Mathematics, 1989
- The complexity of generalized clique coveringDiscrete Applied Mathematics, 1988
- Clustering and domination in perfect graphsDiscrete Applied Mathematics, 1984
- Worst-Case and Probabilistic Analysis of Algorithms for a Location ProblemOperations Research, 1980
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977