1272 search results - page 51 / 255 » The Set Cover with Pairs Problem |
106
Voted
CVIU
2008
15 years 25 days ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
122
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
119
click to vote
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
177
click to vote
RSFDGRC
2011
Springer
14 years 3 months ago
2011
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In interval comp...
123
click to vote
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...