:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Krekelberg, Bob, Liu, Alison Hsiang-Hsuan
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2502.06558
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Firefighting on Cactus Graphs
par: Hugen, Max, et autres
Publié: (2025)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Online Coloring of Short Intervals
par: Chybowska-Sokół, Joanna, et autres
Publié: (2018)

Unit Interval Selection in Random Order Streams
par: Alexandru, Cezar-Mihail, et autres
Publié: (2026)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
par: Honorato-Droguett, Nicolás, et autres
Publié: (2023)

Online Interval Scheduling with Predictions
par: Boyar, Joan, et autres
Publié: (2023)

Online Edge Coloring: Sharp Thresholds
par: Blikstad, Joakim, et autres
Publié: (2025)

Deterministic Online Bipartite Edge Coloring
par: Blikstad, Joakim, et autres
Publié: (2024)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
par: Ma, Will, et autres
Publié: (2019)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
par: Bansal, Nikhil, et autres
Publié: (2026)

Risk-Sensitive Online Algorithms
par: Christianson, Nicolas, et autres
Publié: (2024)

Online Coloring for Graphs of Large Odd Girth
par: Yoneda, Hirotaka, et autres
Publié: (2026)

Online Edge Coloring is (Nearly) as Easy as Offline
par: Blikstad, Joakim, et autres
Publié: (2024)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
par: Chaplick, Steven, et autres
Publié: (2024)

Arboricity-Dependent Algorithms for Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Tree Search With Predictions
par: Dinitz, Michael, et autres
Publié: (2026)

Online Algorithms with Randomly Infused Advice
par: Emek, Yuval, et autres
Publié: (2023)

Investigations on Algorithm Selection for Interval-Based Coding Methods
par: Strutz, Tilo, et autres
Publié: (2024)

Coloring tournaments with few colors: Algorithms and complexity
par: Klingelhoefer, Felix, et autres
Publié: (2023)

An Empirical Study of Online Packet Scheduling Algorithms
par: Sakr, Nourhan, et autres
Publié: (2016)

Dynamic Pricing Algorithms for Online Set Cover
par: Bender, Max, et autres
Publié: (2024)

Optimal Learning-Augmented Algorithm for Online Bidding
par: Lee, Changyeol, et autres
Publié: (2026)

Interval Selection with Binary Predictions
par: Karavasilis, Christodoulos
Publié: (2025)

Exactly Hittable Interval Graphs
par: Dhannya, S. M., et autres
Publié: (2023)

Interval Selection in Sliding Windows
par: Alexandru, Cezar-Mihail, et autres
Publié: (2024)

Random-Order Interval Selection
par: Borodin, Allan, et autres
Publié: (2024)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
par: Koana, Tomohiro, et autres
Publié: (2024)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
par: Ferber, Asaf, et autres
Publié: (2025)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
par: Assadi, Sepehr, et autres
Publié: (2026)

Faster Vizing and Near-Vizing Edge Coloring Algorithms
par: Assadi, Sepehr
Publié: (2024)

Density-Sensitive Algorithms for $(Δ+ 1)$-Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Near-optimal Algorithms for Stochastic Online Bin Packing
par: Ayyadevara, Nikhil, et autres
Publié: (2022)

Algorithms for Efficient, Compact Online Data Stream Curation
par: Moreno, Matthew Andres, et autres
Publié: (2024)

Computational Complexity of the Interval Ordering Problem
par: Pawlowski, Simeon, et autres
Publié: (2026)

Online Graph Coloring for $k$-Colorable Graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2025)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
par: Das, Rathish, et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

Hitting Geodesic Intervals in Structurally Restricted Graphs
par: Gima, Tatsuya, et autres
Publié: (2025)

Interval-Constrained Bipartite Matching over Time
par: Abels, Andreas, et autres
Publié: (2024)