Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
We present a general heuristicfor the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene o...
In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations ...
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...