Copertina

Universal Hirschberg for Width Bounded Dynamic Programs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Nye, Logan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

$\mathrm{TIME}[t]\subseteq \mathrm{SPACE}[O(\sqrt{t})]$ via Tree Height Compression
di: Nye, Logan
Pubblicazione: (2025)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
di: Brita, Catalin E., et al.
Pubblicazione: (2025)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
di: Fioravantes, Foivos, et al.
Pubblicazione: (2025)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
di: Shimoda, Takumi, et al.
Pubblicazione: (2024)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
di: Feldmann, Andreas Emil, et al.
Pubblicazione: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
di: Huisman, Tim, et al.
Pubblicazione: (2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
di: Lanzinger, Matthias, et al.
Pubblicazione: (2023)

A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
di: Philip, Allen George, et al.
Pubblicazione: (2024)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
di: Banik, Aritra, et al.
Pubblicazione: (2025)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
di: Harris, Blake, et al.
Pubblicazione: (2024)

Approximating Optimal Labelings for Temporal Connectivity
di: Carnevale, Daniele, et al.
Pubblicazione: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
di: Almansoori, Mahmood K. M., et al.
Pubblicazione: (2025)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
di: Nguyen, Hue T., et al.
Pubblicazione: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
di: Ganian, Robert, et al.
Pubblicazione: (2025)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
di: Liu, Ruipeng, et al.
Pubblicazione: (2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
di: Wang, Long, et al.
Pubblicazione: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
di: Mitzenmacher, Michael, et al.
Pubblicazione: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
di: Han, Yue, et al.
Pubblicazione: (2025)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
di: Benomar, Ziyad, et al.
Pubblicazione: (2025)

Instance Dependent Testing of Samplers using Interval Conditioning
di: Bhattacharyya, Rishiraj, et al.
Pubblicazione: (2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
di: Ihalainen, Hannes, et al.
Pubblicazione: (2025)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
di: Ehimwenma, Kennedy E., et al.
Pubblicazione: (2025)

Clustering with Label Consistency
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2025)

Efficient Implementation of the Global Cardinality Constraint with Costs
di: Schmied, Margaux, et al.
Pubblicazione: (2025)

Efficient Detection of Exchangeable Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Masked Matrix Multiplication for Emergent Sparsity
di: Wheatman, Brian, et al.
Pubblicazione: (2024)

Adaptive Multi-Round Allocation with Stochastic Arrivals
di: Pan, Yuqi, et al.
Pubblicazione: (2026)

Knapsack: Connectedness, Path, and Shortest-Path
di: Dey, Palash, et al.
Pubblicazione: (2023)

Online Allocation with Unknown Shared Supply
di: Neoh, Tzeh Yuan, et al.
Pubblicazione: (2026)

A Survey on the Densest Subgraph Problem and Its Variants
di: Lanciano, Tommaso, et al.
Pubblicazione: (2023)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
di: Chaudhary, Juhi, et al.
Pubblicazione: (2024)

Stochastic Multi-round Submodular Optimization with Budget
di: Auletta, Vincenzo, et al.
Pubblicazione: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
di: la Tour, Max Dupré, et al.
Pubblicazione: (2024)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
di: Panda, Atasi, et al.
Pubblicazione: (2022)

Lifted Causal Inference in Relational Domains
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

The Complexity of Bayesian Network Learning: Revisiting the Superstructure
di: Ganian, Robert, et al.
Pubblicazione: (2026)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
di: Nakamura, Kengo, et al.
Pubblicazione: (2026)

Nearly Optimal Attention Coresets
di: Liberty, Edo, et al.
Pubblicazione: (2026)

Scalable Algorithms for Approximate DNF Model Counting
di: Burkhardt, Paul, et al.
Pubblicazione: (2026)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
di: Luo, Chunyu, et al.
Pubblicazione: (2024)