Exact algorithms and applications for Tree-like Weighted Set Cover
نویسندگان
چکیده
منابع مشابه
Exact algorithms and applications for Tree-like Weighted Set Cover
We introduce an NP-complete special case of the Weighted Set Cover problem and show its fixed-parameter tractability with respect to the maximum subset size, a parameter that appears to be small in relevant applications. More precisely, in this practically relevant variant we require that the given collection C of subsets of a some base set S should be “tree-like.” That is, the subsets in C can...
متن کاملExact Algorithms and APX-Hardness Results for Geometric Set Cover
We study several geometric set cover problems in which the goal is to compute a minimum cover of a given set of points in Euclidean space by a family of geometric objects. We give a short proof that this problem is APX-hard when the objects are axis-aligned fat rectangles, even when each rectangle is an ǫ-perturbed copy of a single unit square. We extend this result to several other classes of ...
متن کاملExact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general capacitated set cover problem. There is given a set of elements with real weights and a family S of sets of elements. One can use a set if it is a subset of one ...
متن کاملApproximation Algorithms for Submodular Set Cover with Applications
The main problem considered is submodular set cover, the problem of minimizing a linear function under a nondecreasing submodular constraint, which generalizes both wellknown set cover and minimum matroid base problems. The problem is NP-hard, and two natural greedy heuristics are introduced along with analysis of their performance. As applications of these heuristics we consider various specia...
متن کاملGreedy Set-Cover Algorithms
1 PROBLEM DEFINITION Given a collection S of sets over a universe U , a set cover C ⊆ S is a subcollection of the sets whose union is U. The set-cover problem is, given S, to find a minimum-cardinality set cover. In the weighted set-cover problem, for each set s ∈ S a weight w s ≥ 0 is also specified, and the goal is to find a set cover C of minimum total weight s∈C w s. Weighted set cover is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2006
ISSN: 1570-8667
DOI: 10.1016/j.jda.2005.07.005