204 search results - page 1 / 41 » Parameterized Complexity of Cardinality Constrained Optimiza... |
CJ
2008
13 years 5 months ago
2008
DISOPT
2010
13 years 5 months ago
2010
STACS
2010
Springer
13 years 12 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
MST
2007
13 years 4 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...