34 search results - page 4 / 7 » On Miniaturized Problems in Parameterized Complexity Theory |
124
Voted
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
111
Voted
EOR
2008
15 years 1 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
113
click to vote
MST
2006
15 years 1 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
116
Voted
FCT
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
119
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....