Analysis of evolutionary diversity optimization for permutation problems
Generating diverse populations of high-quality solutions has gained interest as a promising
extension to the traditional optimization tasks. This work contributes to this line of research …
extension to the traditional optimization tasks. This work contributes to this line of research …
Computing diverse shortest paths efficiently: A theoretical and experimental study
Finding diverse solutions in combinatorial problems recently has received considerable
attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study …
attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study …
Determinantal sieving
We introduce a new, remarkably powerful tool to the toolbox of algebraic FPT algorithms,
determinantal sieving. Given a polynomial P (x 1,…, xn) over a field 𝔽 of characteristic 2, on …
determinantal sieving. Given a polynomial P (x 1,…, xn) over a field 𝔽 of characteristic 2, on …
A framework to design approximation algorithms for finding diverse solutions in combinatorial problems
Finding a\emph {single} best solution is the most common objective in combinatorial
optimization problems. However, such a single solution may not be applicable to real-world …
optimization problems. However, such a single solution may not be applicable to real-world …
Diverse approximations for monotone submodular maximization problems with a matroid constraint
Finding diverse solutions to optimization problems has been of practical interest for several
decades, and recently enjoyed increasing attention in research. While submodular …
decades, and recently enjoyed increasing attention in research. While submodular …
Diverse pairs of matchings
We initiate the study of the Diverse Pair of (Maximum/Perfect) Matchings problems which
given a graph $ G $ and an integer $ k $, ask whether $ G $ has two (maximum/perfect) …
given a graph $ G $ and an integer $ k $, ask whether $ G $ has two (maximum/perfect) …
Finding diverse strings and longest common subsequences in a graph
In this paper, we study for the first time the Diverse Longest Common Subsequences (LCSs)
problem under Hamming distance. Given a set of a constant number of input strings, the …
problem under Hamming distance. Given a set of a constant number of input strings, the …
Maximization of minimum weighted Hamming distance between set pairs
T Matsuoka, S Ito - Asian Conference on Machine Learning, 2024 - proceedings.mlr.press
Abstract\emph {Finding diverse solutions} to combinatorial optimization problems is
beneficial for a deeper understanding of complicated real-world problems and for simpler …
beneficial for a deeper understanding of complicated real-world problems and for simpler …
Obtaining approximately optimal and diverse solutions via dispersion
There has been a long-standing interest in computing diverse solutions to optimization
problems. In 1995 J. Krarup posed the problem of finding k-edge disjoint Hamiltonian …
problems. In 1995 J. Krarup posed the problem of finding k-edge disjoint Hamiltonian …
Finding diverse minimum st cuts
Recently, many studies have been devoted to finding diverse solutions in classical
combinatorial problems, such as Vertex Cover (Baste et al., IJCAI'20), Matching (Fomin et …
combinatorial problems, such as Vertex Cover (Baste et al., IJCAI'20), Matching (Fomin et …