Searching for "The Pipelined Set Cover Problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

All-norms and all-Lp-norms approximation algorithms
by Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan — 2007
… for the so-called pipelined set cover problem. We then go on to examine approximation algorithms in the “all…
Cited by 1 (0 self) – Add To MetaCart

Using Online Algorithms to Solve NP-Hard Problems More Efficiently in Practice
by Matthew Streeter, Avrim Blum, Carla P. Gomes — 2007
… objective, the offline version of this problem generalizes MIN-SUM SET COVER and the related PIPELINED SET…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB