scientific article; zbMATH DE number 7651147
From MaRDI portal
Publication:5874472
DOI10.4230/LIPICS.ESA.2020.8MaRDI QIDQ5874472FDOQ5874472
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
Title of this publication is not available (Why is that?)
Cites Work
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Universal approximations for TSP, Steiner tree, and set cover
- Analytical approach to parallel repetition
- Semi-streaming set cover (extended abstract)
- Randomized online algorithms for set cover leasing problems
- Title not available (Why is that?)
- Set covering with our eyes closed
- Online and dynamic algorithms for set cover
- Minimum latency submodular cover
- Title not available (Why is that?)
- Improved analysis of the online set cover problem with advice
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- Min-cost bipartite perfect matching with delays
- Online matching: haste makes waste!
- A match in time saves nine: deterministic online matching with delays
- Online service with delay on a line
- Online service with delay
- Title not available (Why is that?)
- Title not available (Why is that?)
- A primal-dual online deterministic algorithm for matching with delays
- \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
- Online algorithms for multi-level aggregation
- The online set aggregation problem
- Incidence geometries and the pass complexity of semi-streaming set cover
- Title not available (Why is that?)
Cited In (3)
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)
