A logic-based algorithmic meta-theorem for mim-width
We introduce a logic called distance neighborhood logic with acyclicity and connectivity
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …
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 …
Swarm-Inspired Computing to Solve Binary Optimization Problems: A Backward Q-Learning Binarization Scheme Selector
M Becerra-Rozas, J Lemus-Romani… - Mathematics, 2022 - mdpi.com
In recent years, continuous metaheuristics have been a trend in solving binary-based
combinatorial problems due to their good results. However, to use this type of …
combinatorial problems due to their good results. However, to use this type of …
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 …
Finding diverse minimum st cuts
M de Berg, AL Martínez, F Spieksma - arXiv preprint arXiv:2303.07290, 2023 - arxiv.org
Recently, many studies have been devoted to finding diverse solutions in classical
combinatorial problems, such as VERTEX COVER (Baste et al., IJCAI'20), MATCHING …
combinatorial problems, such as VERTEX COVER (Baste et al., IJCAI'20), MATCHING …
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 …
Evolutionary Multi-Objective Diversity Optimization
Creating diverse sets of high quality solutions has become an important problem in recent
years. Previous works on diverse solutions problems consider solutions' objective quality …
years. Previous works on diverse solutions problems consider solutions' objective quality …
Finding Diverse Strings and Longest Common Subsequences in a Graph
Y Shida, G Punzi, Y Kobayashi, T Uno… - arXiv preprint arXiv …, 2024 - arxiv.org
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 …
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
The diversity optimization is the class of optimization problems, in which we aim at finding a
diverse set of good solutions. One of the frequently used approaches to solve such problems …
diverse set of good solutions. One of the frequently used approaches to solve such problems …
Finding Diverse Solutions Parameterized by Cliquewidth
K Drabik, T Masařík - arXiv preprint arXiv:2405.20931, 2024 - arxiv.org
Finding a few solutions for a given problem that are diverse, as opposed to finding a single
best solution to solve the problem, has recently become a notable topic in theoretical …
best solution to solve the problem, has recently become a notable topic in theoretical …