Pages that link to "Item:Q3558262"
From MaRDI portal
The following pages link to Covering Analysis of the Greedy Algorithm for Partial Cover (Q3558262):
Displaying 5 items.
- Refined algorithms for hitting many intervals (Q344570) (← links)
- Calculating approximation guarantees for partial set cover of pairs (Q1676481) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Pairs Covered by a Sequence of Sets (Q2947882) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
