9842 search results - page 319 / 1969 » The Complexity of the Matching-Cut Problem |
134
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
120
click to vote
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
119
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
135
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
130
click to vote
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...