Pages that link to "Item:Q876471"

The following pages link to Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks (Q876471):

Displaying 12 items.

• Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
• Towards the price of leasing online (Q346515) (← links)
• Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
• A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
• Towards flexible demands in online leasing problems (Q1750358) (← links)
• Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
• Randomized Online Algorithms for Set Cover Leasing Problems (Q2942379) (← links)
• Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
• Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)