Image de couverture de livre

Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jones, Mark, Schestag, Jannik
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study
par: Komusiewicz, Christian, et autres
Publié: (2024)

Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond
par: van Iersel, Leo, et autres
Publié: (2024)

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
par: Holtgrefe, Niels, et autres
Publié: (2026)

The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth
par: Schestag, Jannik, et autres
Publié: (2026)

Who Should Have a Place on the Ark? Parameterized Algorithms for the Maximization of Phylogenetic Diversity
par: Schestag, Jannik
Publié: (2025)

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
par: Holtgrefe, Niels, et autres
Publié: (2026)

Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
par: Schestag, Jannik
Publié: (2025)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
par: Jones, Mark, et autres
Publié: (2025)

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
par: van Iersel, Leo, et autres
Publié: (2026)

The Art of Staying Ahead of Deadlines: Improved Algorithms for the Minimum Tardy Processing Time
par: Stoian, Mihail
Publié: (2024)

Hardness Results on Characteristics for Elastic-Degenerated Strings
par: Köppl, Dominik, et autres
Publié: (2024)

Maximizing Minimum Cycle Bases Intersection
par: Watel, Dimitri, et autres
Publié: (2024)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
par: Srivastava, Ajitesh, et autres
Publié: (2026)

Logical Expressibility of Syntactic NL for Complementarity, Monotonicity, and Maximization
par: Yamakami, Tomoyuki
Publié: (2024)

Finding Minimum Matching Cuts in $H$-free Graphs
par: Lucke, Felicia, et autres
Publié: (2025)

Finding Maximum Common Contractions Between Phylogenetic Networks
par: Marchand, Bertrand, et autres
Publié: (2024)

Maximal Line Digraphs
par: Japhet, Quentin, et autres
Publié: (2024)

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
par: Guruswami, Venkatesan, et autres
Publié: (2024)

The Space-Time Cost of Purifying Quantum Computations
par: Zhandry, Mark
Publié: (2024)

Maximization of Approximately Submodular Functions
par: Horel, Thibaut, et autres
Publié: (2024)

Diversity of Answers to Conjunctive Queries
par: Merkl, Timo Camillo, et autres
Publié: (2023)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
par: de Berg, Mark, et autres
Publié: (2025)

Linear Planar 3-SAT and Its Applications in Planning
par: Desbois, Victorien, et autres
Publié: (2025)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
par: Chen, Shengminjie, et autres
Publié: (2026)

The Complexity of Maximal Common Subsequence Enumeration
par: Buzzega, Giovanni, et autres
Publié: (2025)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
par: Tran, Tan D., et autres
Publié: (2025)

Sensitivity and Query Complexity under Uncertainty
par: Benson, Deepu, et autres
Publié: (2025)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
par: D'Amico-Wong, Luca, et autres
Publié: (2024)

Deterministic Weighted Automata under Partial Observability
par: Michaliszyn, Jakub, et autres
Publié: (2024)

Closure under factorization from a result of Furstenberg
par: Bhattacharjee, Somnath, et autres
Publié: (2025)

Minimizing Envy and Maximizing Happiness in Graphical House Allocation
par: Dhar, Anubhav, et autres
Publié: (2025)

Diversity of Extensions in Abstract Argumentation
par: Fichte, Johannes K., et autres
Publié: (2026)

A primer on the closure of algebraic complexity classes under factoring
par: Bhargav, C. S., et autres
Publié: (2025)

Query Lower Bounds for Correlation Clustering under Memory Constraints
par: Garg, Sumegha, et autres
Publié: (2026)

Simulating Time With Square-Root Space
par: Williams, R. Ryan
Publié: (2025)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
par: Bhaskar, Umang, et autres
Publié: (2025)

Isomorphism Testing of Rooted Trees in Linear Time
par: Lindeberg, Anna
Publié: (2024)

Trading Determinism for Time: The k-Reach Problem
par: Bhadra, Ronak, et autres
Publié: (2024)

One-Way Functions and Polynomial Time Dimension
par: Nandakumar, Satyadev, et autres
Publié: (2024)

Time hierarchies for sublogarithmic-space quantum computation
par: Say, A. C. Cem
Publié: (2025)