Improved and deterministic online service with deadlines or delay

DOI10.1145/3564246.3585107MaRDI QIDQ6499265

Noam Touitou

Publication date: 8 May 2024

zbMATH Keywords

delaydeadlinesonlineservicek-server

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
• Online service with delay on a line
• Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
• Competitive algorithms for server problems
• Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
• The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
• On the k -server conjecture
• O(depth)-Competitive Algorithm for Online Multi-level Aggregation
• Online service with delay
• Caching with Time Windows and Delays
• Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms
• k-server via multiscale entropic regularization
• Better Approximation Bounds for the Joint Replenishment Problem
• A Polylogarithmic-Competitive Algorithm for the k-Server Problem

This page was built for publication: Improved and deterministic online service with deadlines or delay