455 search results - page 40 / 91 » Approximation Algorithms for Partial Covering Problems |
JCO
2008
14 years 9 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
64
Voted
IPL
2008
14 years 9 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
112
click to vote
MOR
2007
14 years 9 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...