Sciweavers

3874 search results - page 283 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
160
Voted
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 10 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
RECOMB
2010
Springer
15 years 11 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
15 years 6 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
139
Voted
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
COCOON
2006
Springer
15 years 8 months ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang