Search Trees on Trees via LP

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sadeh, Yaniv, Kaplan, Haim, Zwick, Uri
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Beyond Vizing Chains: Improved Recourse in Dynamic Edge Coloring
by: Sadeh, Yaniv, et al.
Published: (2026)

Caching Connections in Matchings
by: Sadeh, Yaniv, et al.
Published: (2023)

Dynamic Edge Coloring of Forests
by: Kaplan, Haim, et al.
Published: (2026)

Faster All-Pairs Optimal Electric Car Routing
by: Dorfman, Dani, et al.
Published: (2025)

Improved Tree Sparsifiers in Near-Linear Time
by: Agassy, Daniel, et al.
Published: (2025)

On Differentially Private Linear Algebra
by: Kaplan, Haim, et al.
Published: (2024)

Minimum-cost paths for electric cars
by: Dorfman, Dani, et al.
Published: (2024)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
by: Brakensiek, Joshua, et al.
Published: (2026)

All-Hops Shortest Paths
by: Williams, Virginia Vassilevska, et al.
Published: (2024)

Expander Decomposition for Non-Uniform Vertex Measures
by: Agassy, Daniel, et al.
Published: (2025)

Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player
by: Agassy, Daniel, et al.
Published: (2022)

Improved girth approximation in weighted undirected graphs
by: Kadria, Avi, et al.
Published: (2025)

MAX BISECTION might be harder to approximate than MAX CUT
by: Brakensiek, Joshua, et al.
Published: (2025)

On the Mysteries of MAX NAE-SAT
by: Brakensiek, Joshua, et al.
Published: (2020)

Chromatic correlation clustering via cluster LP
by: Abbasi, Fateme, et al.
Published: (2025)

A Little Clairvoyance Is All You Need
by: Gupta, Anupam, et al.
Published: (2025)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
by: Gupta, Anupam, et al.
Published: (2026)

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
by: Friggstad, Zachary, et al.
Published: (2025)

Understanding the Cluster LP for Correlation Clustering
by: Cao, Nairen, et al.
Published: (2024)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
by: Lee, Dahoon, et al.
Published: (2025)

Solving the Correlation Cluster LP in Sublinear Time
by: Cao, Nairen, et al.
Published: (2025)

Tree Search With Predictions
by: Dinitz, Michael, et al.
Published: (2026)

Multipass Linear Sketches for Geometric LP-Type Problems
by: Çekirge, N. Efe, et al.
Published: (2025)

Learning-Augmented Algorithms with Explicit Predictors
by: Elias, Marek, et al.
Published: (2024)

Smoothed Analysis of Dynamic Graph Algorithms
by: Meir, Uri, et al.
Published: (2025)

Fast Rational Search via Stern-Brocot Tree
by: Weyers, Connor, et al.
Published: (2025)

Hardness Amplification for Dynamic Binary Search Trees
by: Jiang, Shunhua, et al.
Published: (2024)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
by: Cohen, Edith, et al.
Published: (2025)

Optimal Testing of Reed-Muller Codes with an Online Adversary
by: Kelman, Esty, et al.
Published: (2026)

Homomorphism Testing with Resilience to Online Manipulations
by: Kelman, Esty, et al.
Published: (2025)

Adaptively Robust Resettable Streaming
by: Cohen, Edith, et al.
Published: (2026)

Sketching approximations and LP approximations for finite CSPs are related
by: Singer, Noah G., et al.
Published: (2025)

Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
by: Xiao, Hanyin, et al.
Published: (2025)

Dynamic Connectivity in Disk Graphs
by: Baumann, Alexander, et al.
Published: (2021)

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
by: Cohen, Edith, et al.
Published: (2024)

HART: A Hybrid Addressing Scheme for Self-Balancing Binary Search Trees in Phase Change Memory (PCM)
by: Desai, Mahek, et al.
Published: (2025)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

Fast exact algorithms via the Matrix Tree Theorem
by: Arvind, V., et al.
Published: (2025)

Faster Semi-streaming Matchings via Alternating Trees
by: Mitrović, Slobodan, et al.
Published: (2024)