Pages that link to "Item:Q2392738"
From MaRDI portal
The following pages link to Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738):
Displaying 9 items.
- Optimizing word set coverage for multi-event summarization (Q887893) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Tight Bounds for Double Coverage Against Weak Adversaries (Q2788990) (← links)
- Donation center location problem (Q2920129) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. (Q6075929) (← links)