7930 search results - page 344 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
WADS
2007
Springer
16 years 24 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
179
click to vote
WAOA
2007
Springer
16 years 24 days ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
169
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
159
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
197
click to vote
CIAC
2003
Springer
15 years 10 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...