867 search results - page 57 / 174 » The Generalized Maximum Coverage Problem |
161
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
130
click to vote
EOR
2007
15 years 6 months ago
2007
A multiobjective combinatorial optimization (MOCO) formulation for the following location-routing problem in healthcare management is given: For a mobile healthcare facility, a cl...
162
click to vote
WWW
2001
ACM
16 years 6 months ago
2001
ACM
A wealth of information is available on the Web. But often, such data are hidden behind form interfaces which allow only a restrictive set of queries over the underlying databases...
157
click to vote
ESA
2009
Springer
16 years 17 days ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
152
click to vote
GLOBECOM
2009
IEEE
16 years 23 days ago
2009
IEEE
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...