1272 search results - page 93 / 255 » The Set Cover with Pairs Problem |
92
Voted
MP
1998
15 years 14 days ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
DCOSS
2009
Springer
15 years 7 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
117
click to vote
DASFAA
2006
IEEE
15 years 6 months ago
2006
IEEE
There is much interest in the processing of data streams for applications in the fields such as financial analysis, network monitoring, mobile services, and sensor network manage...
142
click to vote
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
106
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...