Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem

doi 10.1145/3034786.3056116
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Worst Case Analysis of Approximation Algorithm of Abrams Et Al. For the Set K-Cover Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2014English

Jitter-Approximation Tradeoff for Periodic Scheduling

Wireless Networks
Computer NetworksElectronic EngineeringInformation SystemsElectricalCommunications
2006English

A Heuristic Approach for Minimum Set Cover Problem

International Journal of Advanced Research in Artificial Intelligence
2015English

A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover

2010English

On the Advice Complexity of the Set Cover Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Tight Approximation Algorithm for Connectivity Augmentation Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2008English

Thermistor Problem: Multi-Dimensional Modelling, Optimization and Approximation

2018English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

A Nondeterministic Space-Time Tradeoff for Linear Codes

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy