3656 search results - page 114 / 732 » Compact Location Problems |
109
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
109
Voted
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
115
click to vote
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
119
click to vote
METMBS
2003
15 years 2 months ago
2003
— We describe a stochastic optimization method that can be used to solve inverse problems in epidemic modelling. Although in general it cannot be expected that these inverse prob...
121
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...