Results 1 
2 of
2
Local Search for String Problems: Brute Force is Essentially Optimal
"... Abstract. We address the problem of whether the bruteforce procedure for the local improvement step in a local search algorithm can be substantially improved when applied to classical NPhard string problems. We examine four problems in this domain: Closest ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We address the problem of whether the bruteforce procedure for the local improvement step in a local search algorithm can be substantially improved when applied to classical NPhard string problems. We examine four problems in this domain: Closest
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
"... Abstract. In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as poss ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social networks. Typically, graph modification problems are NPhard, making them natural candidates for parameterized complexity studies. We discuss several fruitful interactions between the development of fixedparameter algorithms and the design of heuristics for graph modification problems, featuring quite different aspects of mutual benefits. 1