2031 search results - page 135 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
SIAMCOMP
2008
13 years 8 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
DAM
2010
13 years 8 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
ECCC
2000
13 years 8 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...