3250 search results - page 13 / 650 » Parameterized Learning Complexity |
203
click to vote
DISOPT
2011
15 years 25 days ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
159
click to vote
GD
2007
Springer
16 years 4 hour ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
191
click to vote
TAMC
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
146
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...