Imagen de Portada

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Holtgrefe, Niels, Schestag, Jannik
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
por: Holtgrefe, Niels, et al.
Publicado: (2026)

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
por: van Iersel, Leo, et al.
Publicado: (2026)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
por: Jones, Mark, et al.
Publicado: (2025)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
por: Komusiewicz, Christian, et al.
Publicado: (2023)

Fixed-Parameter Tractable Submodular Maximization over a Matroid
por: Nematollahi, Shamisa, et al.
Publicado: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
por: Bruchhold, Sebastian, et al.
Publicado: (2025)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
por: Arenas, Marcelo, et al.
Publicado: (2024)

Path Partitions of Phylogenetic Networks
por: Lafond, Manuel, et al.
Publicado: (2024)

Reconstructing semi-directed level-1 networks using few quarnets
por: Frohn, Martin, et al.
Publicado: (2024)

Fair Diversity Maximization with Few Representatives
por: Adriaens, Florian, et al.
Publicado: (2025)

Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
por: Olbrich, Jannik
Publicado: (2025)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
por: Ali, Dildar, et al.
Publicado: (2026)

Fixed-Parameter Tractability of Hedge Cut
por: Fomin, Fedor V., et al.
Publicado: (2024)

On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers
por: Bousquet, Nicolas, et al.
Publicado: (2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
por: Pilipczuk, Michał, et al.
Publicado: (2025)

Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
por: Kanellopoulos, Sotiris, et al.
Publicado: (2026)

Binary $k$-Center with Missing Entries: Structure Leads to Tractability
por: Soheil, Farehe, et al.
Publicado: (2025)

When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
por: Klimm, Max, et al.
Publicado: (2026)

Optimal Phylogenetic Reconstruction from Sampled Quartets
por: Arvanitakis, Dionysis, et al.
Publicado: (2026)

On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
por: Kumar, Rinku, et al.
Publicado: (2025)

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
por: Sharma, Vidya Sagar
Publicado: (2023)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
por: Mizutani, Yosuke, et al.
Publicado: (2024)

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
por: Pintér, József, et al.
Publicado: (2026)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
por: Tayal, Mumuksh
Publicado: (2025)

Adwords with Unknown Budgets and Beyond
por: Udwani, Rajan
Publicado: (2021)

Tree Containment Parameterized by Scanwidth
por: van Iersel, Leo, et al.
Publicado: (2026)

The TAG array of a multiple sequence alignment
por: Olbrich, Jannik, et al.
Publicado: (2025)

Node ranking in labeled networks
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

Finding Maximum Common Contractions Between Phylogenetic Networks
por: Marchand, Bertrand, et al.
Publicado: (2024)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
por: Gao, Jie, et al.
Publicado: (2025)

Budget and Profit Approximations for Spanning Tree Interdiction
por: Ostrovsky, Rafail, et al.
Publicado: (2025)

Node-Weighted Multicut in Planar Digraphs
por: Chekuri, Chandra, et al.
Publicado: (2026)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
por: Adamson, Duncan, et al.
Publicado: (2025)

Assigning Agents to Increase Network-Based Neighborhood Diversity
por: Qiu, Zirou, et al.
Publicado: (2023)

Lower Bounds on Flow Sparsifiers with Steiner Nodes
por: Chen, Yu, et al.
Publicado: (2026)

Lower Bounds on $0$-Extension with Steiner Nodes
por: Chen, Yu, et al.
Publicado: (2024)

Hardness and Tractability of T_{h+1}-Free Edge Deletion
por: Gaikwad, Ajinkya, et al.
Publicado: (2026)

A Poisson Process for Submodular Maximization
por: Rozenman, Amit Ganz, et al.
Publicado: (2026)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
por: Wang, Chenhao
Publicado: (2025)