Competitive Search in the Line and the Star with Predictions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Angelopoulos, Spyros
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Scenario-Based Robust Optimization of Tree Structures
by: Angelopoulos, Spyros, et al.
Published: (2024)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2025)

Online Computation with Untrusted Advice
by: Angelopoulos, Spyros, et al.
Published: (2019)

Cache Management for Mixture-of-Experts LLMs -- extended version
by: Angelopoulos, Spyros, et al.
Published: (2025)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2024)

The Pareto Frontier of Randomized Learning-Augmented Online Bidding
by: Degryse, Mathis, et al.
Published: (2026)

Contract Scheduling with Distributional and Multiple Advice
by: Angelopoulos, Spyros, et al.
Published: (2024)

Online Bin Packing with Predictions
by: Angelopoulos, Spyros, et al.
Published: (2021)

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
by: Karathanasis, Konstantinos, et al.
Published: (2025)

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

Dynamic Breadth First Search with Predictions
by: Khan, Shahbaz, et al.
Published: (2026)

Estimating Hitting Times Locally At Scale
by: Haris, Themistoklis, et al.
Published: (2025)

Competitively Consistent Clustering
by: Buchbinder, Niv, et al.
Published: (2025)

Competitive Online Transportation Simplified
by: Arndt, Stephen, et al.
Published: (2025)

Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
by: Georgiou, Konstantinos, et al.
Published: (2025)

Competitive Policies for Online Collateral Maintenance
by: Almashaqbeh, Ghada, et al.
Published: (2024)

On Competitiveness of Dynamic Replication for Distributed Data Access
by: Zuo, Tianyu, et al.
Published: (2025)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
by: Harada, Tsubasa
Published: (2024)

Iterated Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)

Generalized Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
by: Bijoy, Adithya, et al.
Published: (2025)

A Competitive Algorithm for Throughput Maximization on Identical Machines
by: Moseley, Benjamin, et al.
Published: (2021)

Beating Competitive Ratio 4 for Graphic Matroid Secretary
by: Banihashem, Kiarash, et al.
Published: (2025)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
by: Dufay, Marc, et al.
Published: (2025)

On the Advice Complexity of Online Matching on the Line
by: Csaba, Béla, et al.
Published: (2024)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
by: Ganz, Amit, et al.
Published: (2023)

Tight Competitive and Variance Analyses of Matching Policies in Gig Platforms
by: Xu, Pan
Published: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
by: Kalavas, Andreas, et al.
Published: (2025)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
by: Goyal, Vineet, et al.
Published: (2020)

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
by: Jäger, Sven, et al.
Published: (2022)

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
by: Feng, Yiding, et al.
Published: (2026)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
by: Kalavas, Andreas, et al.
Published: (2025)

Online Graph Embedding in Star Graphs
by: Dallot, Julien, et al.
Published: (2026)

Online Drone Coverage of Targets on a Line
by: Dobrev, Stefan, et al.
Published: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
by: Antoniadis, Antonios, et al.
Published: (2020)

Learning Minimum Linear Arrangement of Cliques and Lines
by: Dallot, Julien, et al.
Published: (2024)

Balancing Two-Dimensional Straight-Line Programs
by: Boneh, Itai, et al.
Published: (2025)

Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
by: Bienkowski, Marcin, et al.
Published: (2026)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
by: Ma, Will, et al.
Published: (2019)