1772 search results - page 129 / 355 » Classifying Problems into Complexity Classes |
141
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
179
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
173
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
290
click to vote
DISOPT
2011
15 years 1 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
180
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...