WebJan 28, 2024 · In the submodular cover problem, we are given a monotone submodular function f: 2 N R +, and we want to pick the min-cost set S such that f(S) = f(N).This … Websubmodular valuations, but the best known online algorithm gave only an o(1) improvement over 1=2 [DS06]. Our results. We prove that: In the online setting with submodular valuations, the factor of 1=2 cannot be improved unless NP = RP (even by randomized algorithms against an oblivious adversary). Hence, the greedy
SIMILAR: Submodular Information Measures Based Active …
WebOnline Submodular Minimization for Combinatorial Structures Table 1. Overview of regret bounds. The approximation factor is underlined, kis the maximum frequency, Uthe universe to cover. In a graph G= (V;E), n= jVj; for set cover, mis the number of sets. for complete bipartite graphs set cover vertex cover (s;t)-cut spanning tree perfect matching WebNov 18, 2024 · There exists a large body of literature studying the above problem and there is a beautiful line of research in this field. When c is a linear function and f is a submodular function, the above problem is known as Minimum Submodular Cover problem. The greedy algorithm proposed by Wolsey produces an \(H(\delta )\)-approximation solution for … moffetts nuig
A Generalization of Submodular Cover via the Diminishing
WebJan 28, 2024 · In the submodular cover problem, we are given a monotone submodular function f: 2 N R +, and we want to pick the min-cost set S such that f(S) = f(N).This captures the set cover problem when f is a coverage function. Motivated by problems in network monitoring and resource allocation, we consider the submodular cover problem in an … WebCoverage breach problems in bandwidth-constrained sensor networks Weili Wu, Maggie Xiaoyan Cheng, Lu Ruan, 2007, TOSN. An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks ... Non-submodular model for group profit maximization problem in social networks Weili Wu, Jian-ming Zhu, Smita Ghosh, 2024 . ... Webproperties and use it in characterizing an LP relaxation to the online submodular cover problem. This paper provides a complete picture of the combinatorial information measures defined via general submodular functions, by studying various properties, examples, optimization problems, and applications. A road-map of this paper is as follows. moffett street south shields