Image de couverture de livre

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Antoniadis, Antonios, Englert, Matthias, Matsakis, Nicolaos, Veselý, Pavel
Format:	Preprint
Publié:	2020
Sujets:	Data Structures and Algorithms F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Streaming Algorithms for Bin Packing and Vector Scheduling
par: Cormode, Graham, et autres
Publié: (2019)

A Tight Lower Bound for Comparison-Based Quantile Summaries
par: Cormode, Graham, et autres
Publié: (2019)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
par: Duan, Ran, et autres
Publié: (2025)

Streaming Diameter of High-Dimensional Points
par: Halldórsson, Magnús M., et autres
Publié: (2025)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
par: Dvořák, Pavel, et autres
Publié: (2017)

A Simple yet Exact Analysis of the MultiQueue
par: Walzer, Stefan, et autres
Publié: (2024)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
par: Le, Hung, et autres
Publié: (2023)

Drawing Competitive Districts in Redistricting
par: Chuang, Gabriel, et autres
Publié: (2024)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

A $2$-branching construction for the $χ\leq 2r$ bound
par: Date, Vinicius Tikara Venturi, et autres
Publié: (2026)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
par: Kammer, Frank, et autres
Publié: (2020)

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Offline green bin packing and its constrained variant
par: Gong, Mingyang, et autres
Publié: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
par: Blomer, Valentin, et autres
Publié: (2026)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
par: Emmerich, Michael
Publié: (2025)

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

Hierarchical Exponential Search Via K-Spines
par: Dong, Bob
Publié: (2025)

On the satisfability of random k-Horn formulae
par: Istrate, Gabriel
Publié: (2000)

Search and evacuation with a near majority of faulty agents
par: Czyzowicz, J., et autres
Publié: (2026)

Approximation algorithms for Job Scheduling with reconfigurable resources
par: Bergé, Pierre, et autres
Publié: (2023)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

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

Simple in-place yet comparison-optimal Mergesort
par: Siebert, Christian
Publié: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
par: Amouzandeh, Aflatoun, et autres
Publié: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
par: Hommelsheim, Felix, et autres
Publié: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
par: Bouchard, Sébastien, et autres
Publié: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
par: Ahn, Jungho, et autres
Publié: (2025)

Fast Order Statistics with Group Inequality Testing
par: Liyanage, Adiesha, et autres
Publié: (2025)