Pages that link to "Item:Q3004668"
From MaRDI portal
The following pages link to Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668):
Displaying 4 items.
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Tight Bounds for Double Coverage Against Weak Adversaries (Q2788990) (← links)