Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,478,027 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
On Selecting Vehicles as Recommenders for Vehicular Social Networks
Ting Li
,
Ming Zhao
,
Anfeng Liu
,
Changqin Huang
IEEE Access
2017
Corpus ID: 3422448
Vehicular social networks, as one type of new future networks, integrate mobile wireless communications and social networks…
Expand
2017
2017
Proof-based coverage metrics for formal verification
Elaheh Ghassabani
,
Andrew Gacek
,
M. Whalen
,
M. Heimdahl
,
Lucas G. Wagner
International Conference on Automated Software…
2017
Corpus ID: 21381578
When using formal verification on critical software, an important question involves whether we have we specified enough…
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
2016
2016
Democratic elections and centralized decisions: Condorcet and Approval Voting compared with Median and Coverage locations
Mozart B. C. Menezes
,
G. D. Silveira
,
Z. Drezner
European Journal of Operational Research
2016
Corpus ID: 20373381
2014
2014
Maximum coverage heuristics (MCH) for target coverage problem in Wireless Sensor Network
Dimple Bajaj
,
Manju
IEEE International Advance Computing Conference
2014
Corpus ID: 18046933
Wireless Sensor Network is useful in broad range of applications such as natural disaster relief, military, environmental and…
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
Functional SOA testing based on constraints
Seema Jehan
,
Ingo Pill
,
F. Wotawa
International Conference/Workshop on Automation…
2013
Corpus ID: 1018275
In the fierce competition on today's software market, Service-Oriented Architectures (SOAs) are an established design paradigm…
Expand
2011
2011
Packet scheduling in a low-latency optical switch with wavelength division multiplexing and electronic buffer
Lin Liu
,
Zhenghao Zhang
,
Yuanyuan Yang
Proceedings IEEE INFOCOM
2011
Corpus ID: 17932717
Optical switches are widely considered as the most promising candidate to provide ultra-high speed interconnections. Due to the…
Expand
2011
2011
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
M. Cheng
,
Xuan Gong
Journal of Global Optimization
2011
Corpus ID: 5383733
In wireless sensor networks, when each target is covered by multiple sensors, sensors can take turns to monitor the targets in…
Expand
2005
2005
A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
Joni L. Jones
,
G. J. Koehler
INFORMS journal on computing
2005
Corpus ID: 17903500
Combinatorial auctions address the sale of materials where there exist complementarities between items. A major stumbling block…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE