scientific article; zbMATH DE number 6850467
From MaRDI portal
Publication:4608053
zbMath1403.68361arXiv1902.03534MaRDI QIDQ4608053
Anak Yodpinyanee, Ali Vakilian, Sepideh Mahabadi, Ronitt Rubinfeld, Piotr Indyk
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1902.03534
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Almost optimal query algorithm for hitting set using a subset query ⋮ Unnamed Item ⋮ Beep-and-sleep: message and energy efficient set cover ⋮ Beep-and-sleep: message and energy efficient set cover ⋮ Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
This page was built for publication:
