1272 search results - page 68 / 255 » The Set Cover with Pairs Problem |
96
Voted
IPL
2008
15 years 24 days ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
96
Voted
BMCBI
2008
15 years 27 days ago
2008
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...
110
Voted
IJSNET
2008
15 years 9 days ago
2008
Abstract: This paper addresses the target coverage problem in wireless sensor networks. Communication and sensing consume energy, therefore efficient power management can extend ne...
111
click to vote
IOR
2006
15 years 23 days ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
128
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...