572 search results - page 58 / 115 » Exponential-Time Approximation of Hard Problems |
77
Voted
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
170
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
104
click to vote
SODA
2010
ACM
14 years 8 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...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...