16404 search results - page 76 / 3281 » A set coverage problem |
114
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
99
Voted
DLT
2010
15 years 2 months ago
2010
Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these lan...
109
Voted
JOTA
2010
14 years 7 months ago
2010
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
103
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
125
Voted
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...