3874 search results - page 159 / 775 » Approximation Algorithms for k-hurdle Problems |
129
click to vote
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
118
click to vote
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
108
Voted
SARA
2007
Springer
15 years 8 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
124
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
104
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...