5595 search results - page 439 / 1119 » Approximation Algorithms for Clustering Problems |
216
click to vote
EC
2010
15 years 4 months ago
2010
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
174
Voted
ISAAC
2004
Springer
16 years 7 days ago
2004
Springer
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...
142
Voted
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
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....
201
Voted
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
139
Voted
ANOR
2007
15 years 7 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...