Sciweavers

4377 search results - page 66 / 876
» Mass problems and randomness
Sort
View
IPCO
1992
115views Optimization» more  IPCO 1992»
14 years 11 months ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
Alan M. Frieze, Richard M. Karp, Bruce A. Reed
EOR
2007
163views more  EOR 2007»
14 years 9 months ago
The multi-depot vehicle routing problem with inter-depot routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
Benoit Crevier, Jean-François Cordeau, Gilb...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 3 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
CORR
2006
Springer
146views Education» more  CORR 2006»
14 years 10 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
ICALP
2004
Springer
15 years 3 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler