7150 search results - page 170 / 1430 » An Approximation Algorithm for Approximation Rank |
164
click to vote
EOR
2002
15 years 6 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
206
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
148
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
184
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
119
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th