1389 search results - page 81 / 278 » Improved Approximation Algorithms for Label Cover Problems |
123
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
115
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
123
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
117
click to vote
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
104
click to vote
EVOW
2009
Springer
15 years 9 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...