Imagen de Portada

An Empirical Study of Online Packet Scheduling Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sakr, Nourhan, Stein, Cliff
Formato:	Preprint
Publicado:	2016
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Learning-Augmented Online Packet Scheduling with Deadlines
por: Liang, Ya-Chun, et al.
Publicado: (2023)

A Simple Algorithm for Dynamic Carpooling with Recourse
por: Efron, Yuval, et al.
Publicado: (2024)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
por: Das, Rathish, et al.
Publicado: (2025)

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
por: Hertrich, Christoph, et al.
Publicado: (2020)

Online Makespan Scheduling under Scenarios
por: Ergen, Ekin
Publicado: (2025)

Online Drone Scheduling for Last-mile Delivery
por: Jana, Saswata, et al.
Publicado: (2024)

Approximation Algorithms for Fair Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2025)

Online Flexible Busy Time Scheduling on Heterogeneous Machines
por: Calinescu, Gruia, et al.
Publicado: (2024)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
por: Chen, Qingyun, et al.
Publicado: (2024)

Risk-Sensitive Online Algorithms
por: Christianson, Nicolas, et al.
Publicado: (2024)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
por: Grus, Josef, et al.
Publicado: (2024)

Approximation Algorithms for Scheduling Crowdsourcing Tasks in Mobile Social Networks
por: Chen, Chi-Yeh
Publicado: (2025)

Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting
por: Jeang, John, et al.
Publicado: (2026)

Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks
por: Chen, Chi-Yeh
Publicado: (2026)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
por: Zhao, Jingyang, et al.
Publicado: (2025)

Online Algorithms with Randomly Infused Advice
por: Emek, Yuval, et al.
Publicado: (2023)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
por: Sinhal, Anay, et al.
Publicado: (2026)

Dynamic Pricing Algorithms for Online Set Cover
por: Bender, Max, et al.
Publicado: (2024)

Optimal Learning-Augmented Algorithm for Online Bidding
por: Lee, Changyeol, et al.
Publicado: (2026)

On the FirstFit Algorithm for Online Unit-Interval Coloring
por: Krekelberg, Bob, et al.
Publicado: (2025)

Near-optimal Algorithms for Stochastic Online Bin Packing
por: Ayyadevara, Nikhil, et al.
Publicado: (2022)

Algorithms for Efficient, Compact Online Data Stream Curation
por: Moreno, Matthew Andres, et al.
Publicado: (2024)

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

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
por: Bringmann, Karl, et al.
Publicado: (2026)

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

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

Energy-Efficient Scheduling with Predictions
por: Balkanski, Eric, et al.
Publicado: (2024)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
por: Geng, Yutong, et al.
Publicado: (2025)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
por: Kesselheim, Thomas, et al.
Publicado: (2025)

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

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
por: Bathie, Gabriel, et al.
Publicado: (2023)

Learning-Augmented Online Scheduling with Parsimonious Preemption
por: Blue, Mugen, et al.
Publicado: (2026)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
por: Mendoza-Cadena, Mirabel, et al.
Publicado: (2026)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
por: Basiak, Mateusz, et al.
Publicado: (2025)

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
por: Udwani, Rajan
Publicado: (2024)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
por: Hsieh, Yi-Ting, et al.
Publicado: (2025)

Online Interval Scheduling with Predictions
por: Boyar, Joan, et al.
Publicado: (2023)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
por: Mieno, Takuya, et al.
Publicado: (2024)

Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
por: Turoczy, Alexander, et al.
Publicado: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)