5595 search results - page 975 / 1119 » Approximation Algorithms for Clustering Problems |
161
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
128
click to vote
CPAIOR
2009
Springer
15 years 11 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
162
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
275
click to vote
GIS
2006
ACM
16 years 6 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
132
click to vote
RECOMB
2008
Springer
16 years 5 months ago
2008
Springer
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...