Results 1 
4 of
4
Reflections on multivariate algorithmics and problem parameterization
 PROC. 27TH STACS
, 2010
"... Research on parameterized algorithmics for NPhard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops into the field of multivariate algorithmics. Correspondingly, we describe how to perform a systematic investigation and e ..."
Abstract

Cited by 36 (21 self)
 Add to MetaCart
(Show Context)
Research on parameterized algorithmics for NPhard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops into the field of multivariate algorithmics. Correspondingly, we describe how to perform a systematic investigation and exploitation of the “parameter space” of computationally hard problems.
Minimum Common String Partition Parameterized ⋆
"... Abstract. Minimum Common String Partition (MCSP) and related problems are of interest in, e.g., comparative genomics, DNA fingerprint assembly, and ortholog assignment. Given two strings with equal symbol content, the problem is to partition one string into k blocks, k as small as possible, and to p ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Minimum Common String Partition (MCSP) and related problems are of interest in, e.g., comparative genomics, DNA fingerprint assembly, and ortholog assignment. Given two strings with equal symbol content, the problem is to partition one string into k blocks, k as small as possible, and to permute them so as to obtain the other string. MCSP is NPhard, and only approximation algorithms are known. Here we show that MCSP is fixedparameter tractable in suitable parameters, so that practical instances can be efficiently solved to optimality. 1 Parameterization of MCSP String z is called a substring of string x, if there exist strings u, v (possibly empty) such that x = uzv. The same substring z may appear at several positions in x. By a segment of x we mean an occurence of a substring at a specific position in x. A substring or segment may be empty, where an empty segment is defined by its location between two consecutive symbols. Length x  is the number of symbol occurences in x.
DFLAT: Declarative problem solving using tree . . .
 LOGIC PROGRAMMING, 12, PP 445464
, 2012
"... ..."
Under consideration for publication in Theory and Practice of Logic Programming 1 DFLAT: Declarative Problem Solving Using Tree Decompositions and AnswerSet Programming
"... In this work, we propose AnswerSet Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed, but only a few of them found their way into implementation. The main obstacle is the lack of easyto ..."
Abstract
 Add to MetaCart
In this work, we propose AnswerSet Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed, but only a few of them found their way into implementation. The main obstacle is the lack of easytouse systems which (i) take care of building a tree decomposition and (ii) provide an interface for declarative specifications of dynamic programming algorithms. In this paper, we present DFLAT, a novel tool that relieves the user of having to handle all the technical details concerned with parsing, tree decomposition, the handling of data structures, etc. Instead, it is only the dynamic programming algorithm itself which has to be specified in the ASP language. DFLAT employs an ASP solver in order to compute the local solutions in the dynamic programming algorithm. In the paper, we give a few examples illustrating the use of DFLAT and describe the main features of the system. Moreover, we report experiments which show that ASPbased DFLAT encodings for some problems outperform monolithic ASP encodings on instances of small treewidth. To appear in Theory and Practice of Logic Programming (TPLP). 1