Sciweavers

129 search results - page 26 / 26
» Algorithms for facility location problems with outliers
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
13 years 11 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
RECOMB
2008
Springer
14 years 6 months ago
Constructing Treatment Portfolios Using Affinity Propagation
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 ...
Delbert Dueck, Brendan J. Frey, Nebojsa Jojic, Vla...
COMPGEOM
2006
ACM
13 years 11 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
PPOPP
2006
ACM
13 years 11 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller