A multivariate complexity analysis of the generalized Noah's ark problem

DOI10.1016/J.DAM.2025.11.037MaRDI QIDQ6859892zbMATH OpenFDO

Authors Christian Komusiewicz, Jannik Schestag

Publication date 11 February 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.11.037

zbMATH Keywords

FPTmultiple-choice knapsackNoah's ark problemparameterized complexityphylogenetic diversity

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Problems related to evolution (92D15)

Cites work

• A minimal algorithm for the multiple-choice knapsack problem
• A multivariate complexity analysis of the generalized Noah's ark problem
• An application of simultaneous diophantine approximation in combinatorial optimization
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Knapsack problems: a parameterized point of view
• On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks
• Optimizing phylogenetic diversity under constraints
• Parameterized algorithms
• Parameterizing by the number of numbers
• Phylogenetic diversity and biodiversity indices on phylogenetic networks
• Phylogenetic network diversity parameterized by reticulation number and beyond
• Polynomial kernels for weighted problems
• The 0-1 knapsack problem with multiple choice constraints
• The Noah's Ark Problem

This page was built for publication: A multivariate complexity analysis of the generalized Noah's ark problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859892)