3874 search results - page 63 / 775 » Approximation Algorithms for k-hurdle Problems |
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
GECCO
2010
Springer
14 years 11 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
112
click to vote
ESA
2003
Springer
15 years 3 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...