Searching for "The Generalized Maximum Coverage Problem." – sorted by Relevance.
-
The Generalized Maximum Coverage Problem
- The Generalized Maximum Coverage Problem Reuven Cohen Liran Katzir Department of Computer Science
- Add To MetaCart
-
Postprocessing decision trees to extract actionable knowledge
- guarantee the quality of the solution at the same time. Consider the following generalization of the maximum
- Cited by 5 (1 self) – Add To MetaCart
-
Optimizing Multiple Spaced Seeds for Homology Search
- we choose the random regions, we castthe problem as a maximum k-coverage problem. Suppose we have a
- Cited by 27 (5 self) – Add To MetaCart
-
On the Routing and Wavelength Assignment in Multifiber WDM Networks
- the RWA problem to the more general maximum coverage problem. Given a universal set U of elements
- Cited by 4 (0 self) – Add To MetaCart
-
Approximating minimum-power degree and connectivity problems
- - 1/e ratio (this ratio is optimal as our problem generalizes the Maximum-Coverage problem that admits
- Cited by 2 (1 self) – Add To MetaCart
-
Mixed covering of trees and the augmentation problem with odd diameter constraints
- R2 to maximize the total number of covered vertices. This problem generalizes the MAXIMUM COVERAGE
- Cited by 2 (2 self) – Add To MetaCart
-
On Approximation of Max-Vertex-Cover
- of the general maximum coverage problem; see Cornuejols, Fisher, and Nemhauser [4]. It has been proved
- Cited by 4 (0 self) – Add To MetaCart

