Pages that link to "Item:Q5361872"

The following pages link to Tight bounds for single-pass streaming complexity of the set cover problem (Q5361872):

Displaying 8 items.

• Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← links)
• Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
• Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
• Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
• Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
• Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
• Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
• Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)