Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,860,659 papers from all fields of science
Search
Sign In
Create Free Account
Maximum coverage problem
The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research.It is a problem…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Computational complexity theory
Computer science
Greedy algorithm
Operations research
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Non-personalized Movie Recommendation by Maximum k-Coverage
N. Silva
,
Diego Carvalho
,
A. Pereira
,
Fernando Mourão
,
L. Rocha
Journal of Information and Data Management
2017
Corpus ID: 3631307
Turning first-time users into returning ones is a major task for the success of e-commerce systems. However, providing effective…
Expand
2017
2017
DYNAMIC DEPLOYMENT OF HOMOGENEOUS SENSOR NODES USING PLANT PROPAGATION ALGORITHM WITH MAXIMUM COVERAGE
R. Kaur
2017
Corpus ID: 55948888
— Wireless sensor network serves as a nursery for umpteen cosmic fields such as defense, security, scientific applications and…
Expand
2016
2016
Applying a Pairwise Coverage Criterion to Scenario-Based Testing
L. D. Bousquet
,
Mickaël Delahaye
,
Catherine Oriat
International Conference on Software Testing…
2016
Corpus ID: 6570284
Some scenario-based testing approaches propose to express a test suite as a regular expression (called scenario or pattern). It…
Expand
2015
2015
Planning the communication infrastructure for vehicular networks without tracking vehicles
C. M. Silva
,
J. F. M. Sarubbi
,
Wagner Meira Jr
IEEE International Conference on Wireless and…
2015
Corpus ID: 787145
This work presents a novel algorithm for the deployment of roadside units based on partial mobility information. Instead of…
Expand
2014
2014
Maximum lifetime coverage problems with battery recovery effects
Norie Fu
,
Vorapong Suppakitpaisarn
,
K. Kimura
,
Naonori Kakimura
IEEE Global Communications Conference
2014
Corpus ID: 11314243
Scheduling sensors to prolong the lifetime of covering targets in the field is one of the central problems in wireless sensor…
Expand
2013
2013
Sea-ice Fauna
K. Swadling
2013
Corpus ID: 56203566
Sea ice is a dominant feature of the Southern Ocean marine ecosystem, playing a central role in physical processes and providing…
Expand
2010
2010
Efficient method of station selection for passive monitoring in distributed network using information gain
Xiang Li
,
F. Qi
,
Yiguo Yuan
,
Xue-song Qiu
The IEEE symposium on Computers and…
2010
Corpus ID: 20914234
Network monitoring is essential for assessing performance issues, identifying and locating problems. There is increasing interest…
Expand
2008
2008
Approximate Algorithm for the Budgeted Maximum Coverage Problem
He Shanglu
2008
Corpus ID: 124667328
Discuss the maximum coverage problem subject to a budgeted constant,presents an improved greedy algorithm which has(1-e-1…
Expand
2006
2006
Rutcor Research Report RRR 9 , 2006 Maximum Patterns in Datasets
T. Bonates
,
P. Hammer
,
A. Kogan
2006
Corpus ID: 8258606
Given a binary dataset of positive and negative observations, a positive (negative) pattern is a subcube having a nonempty…
Expand
2003
2003
Budgeted Coverage of a Maximum Part of a Polygonal Area
Euripides Markou
,
S. Zachos
,
Christodoulos Fragoudakis
2003
Corpus ID: 14513674
Given is a polygonal area and the goal is to cover the polygon’s interior or boundary by placing a number of stations in the…
Expand