scientific article; zbMATH DE number 7651147

DOI10.4230/LIPICS.ESA.2020.8MaRDI QIDQ5874472zbMATH OpenFDO

Authors Ashish Chiplunkar, Shay Kutten, Noam Touitou, Yossi Azar

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1807.08543

zbMATH Keywords

clairvoyantdelayset cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
• A match in time saves nine: deterministic online matching with delays
• A primal-dual online deterministic algorithm for matching with delays
• Analytical approach to parallel repetition
• scientific article; zbMATH DE number 6696496 (Why is no real title available?)
• scientific article; zbMATH DE number 1256771 (Why is no real title available?)
• scientific article; zbMATH DE number 1775424 (Why is no real title available?)
• scientific article; zbMATH DE number 7051295 (Why is no real title available?)
• scientific article; zbMATH DE number 7651147 (Why is no real title available?)
• Improved analysis of the online set cover problem with advice
• Incidence geometries and the pass complexity of semi-streaming set cover
• Min-cost bipartite perfect matching with delays
• Online algorithms for multi-level aggregation
• Online and dynamic algorithms for set cover
• Online matching: haste makes waste!
• Online service with delay
• Online service with delay on a line
• Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
• Randomized online algorithms for set cover leasing problems
• Semi-streaming set cover (extended abstract)
• Set covering with our eyes closed
• The online set aggregation problem
• Universal approximations for TSP, Steiner tree, and set cover
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

Cited in

(8)

• Set covering with our eyes closed
• Speed is more powerful than clairvoyance
• scientific article; zbMATH DE number 7651147 (Why is no real title available?)
• List update with delays or time windows
• Universal optimization for non-clairvoyant subadditive joint replenishment
• Online matching with delays and stochastic arrival times
• Universal optimization for non-clairvoyant subadditive joint replenishment
• Online multi-level aggregation with delays and stochastic arrivals

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874472)