Cover Image

Optimal bounds on a tree inference algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gardiner, Jack, Andrew, Lachlan L. H., Gan, Junhao, Honorio, Jean, Umboh, Seeun William
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
by: Cervenjak, Philip, et al.
Published: (2024)

Optimal Dynamic Parameterized Subset Sampling
by: Gan, Junhao, et al.
Published: (2024)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
by: Cervenjak, Philip, et al.
Published: (2026)

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
by: Shmoys, David, et al.
Published: (2026)

Online TCP Acknowledgment under General Delays
by: Bhore, Sujoy, et al.
Published: (2026)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
by: Dinitz, Michael, et al.
Published: (2025)

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
by: Canonne, Clément L., et al.
Published: (2025)

Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
by: Bartal, Yair, et al.
Published: (2024)

Online Computation of String Net Frequency
by: Guo, Peaker, et al.
Published: (2024)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
by: Ezra, Tomer, et al.
Published: (2024)

Colorful Vertex Recoloring of Bipartite Graphs
by: Patt-Shamir, Boaz, et al.
Published: (2025)

Parallel batch queries on dynamic trees: algorithms and experiments
by: Ikram, Humza, et al.
Published: (2025)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
by: Cervenjak, Philip, et al.
Published: (2023)

Composing dynamic programming tree-decomposition-based algorithms
by: Baste, Julien
Published: (2019)

A computational study of Gomory-Hu construction tree algorithms
by: Kolmogorov, Vladimir
Published: (2022)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
by: Foucaud, Florent, et al.
Published: (2025)

Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters
by: Zhao, Zhuowei, et al.
Published: (2024)

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
by: Zhao, Zhuowei, et al.
Published: (2025)

Optimal lower bounds for quantum state tomography
by: Scharnhorst, Thilo, et al.
Published: (2025)

Optimal Bounds for Open Addressing Without Reordering
by: Farach-Colton, Martin, et al.
Published: (2025)

Fingerprint Filters Are Optimal
by: Kuszmaul, William, et al.
Published: (2025)

Parameterized algorithms for $k$-Inversion
by: Antony, Dhanyamol, et al.
Published: (2026)

Optimal Non-Oblivious Open Addressing
by: Bender, Michael A., et al.
Published: (2025)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
by: Tsin, Yung H.
Published: (2023)

Static Retrieval Revisited: To Optimality and Beyond
by: Hu, Yang, et al.
Published: (2025)

Nearly Optimal List Labeling
by: Bender, Michael A., et al.
Published: (2024)

Nine lower bound conjectures on streaming approximation algorithms for CSPs
by: Singer, Noah G.
Published: (2025)

Round-efficient Fully-scalable MPC algorithms for k-Means
by: Jiang, Shaofeng H. -C., et al.
Published: (2026)

Performance bounds for nearest neighbor search with k-d trees
by: Bazzani, Marco, et al.
Published: (2026)

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

Theoretical insights and an experimental comparison of tango trees and multi-splay trees
by: Al-Adhami, Khaleel, et al.
Published: (2024)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
by: Bodlaender, Hans L., et al.
Published: (2025)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
by: Wesołowski, Adam, et al.
Published: (2025)

Near-Optimal Algorithm for Directed Expander Decompositions
by: Sulser, Aurelio L., et al.
Published: (2024)

SquareSort: a cache-oblivious sorting algorithm
by: Koucký, Michal, et al.
Published: (2024)

Streaming algorithms for products of probabilities
by: Lohrey, Markus, et al.
Published: (2025)

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
by: Lin, Honghao, et al.
Published: (2025)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
by: Hochbaum, Dorit S.
Published: (2024)

Near-Optimal Dimension Reduction for Facility Location
by: Huang, Lingxiao, et al.
Published: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
by: Kolmogorov, Vladimir, et al.
Published: (2026)