Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
From MaRDI portal
Publication:2667823
DOI10.1016/j.artint.2021.103644OpenAlexW3214981176MaRDI QIDQ2667823
Tomáš Masařík, Geevarghese Philip, Lars Jaffke, Michael R. Fellows, Julien Baste, Mateus de Oliveira Oliveira, Frances A. Rosamond
Publication date: 2 March 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.07410
Related Items (4)
Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem ⋮ The structural complexity landscape of finding balance-fair shortest paths ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ Diverse collections in matroids and graphs
Cites Work
- Unnamed Item
- Fundamentals of parameterized complexity
- How to select a small set of diverse solutions to mixed integer programming problems
- Experiments concerning sequential versus simultaneous maximization of objective function and distance
- Branch \& Sample: A simple strategy for constraint satisfaction
- Cutting stock problems and solution procedures
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity
- Generating Diverse Solutions in SAT
- Nondeterminism within $P^ * $
- Kernelization
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Finding similar/diverse solutions in answer set programming
- Parameterized Algorithms
- What Is Known About Vertex Cover Kernelization?
This page was built for publication: Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
