7930 search results - page 298 / 1586 » Greedy in Approximation Algorithms |
162
click to vote
DISOPT
2006
15 years 6 months ago
2006
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
168
click to vote
JPDC
2007
15 years 6 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
163
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
182
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
218
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...