U. Feige, A threshold of ln n for approximating set cover, in 28th ACM Symposium on Theory of Computing, 1996, pp. 314--318. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Clustering Algorithms for Ad Hoc Wireless Networks - Chen, Liestman, Liu (2004) (3 citations) (Correct)
No context found.
U. Feige, A threshold of ln n for approximating set cover, in 28th ACM Symposium on Theory of Computing, 1996, pp. 314--318.
Beyond Independent Relevance: Methods and Evaluation - Metrics For Subtopic (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634--652, July 1998.
Simultaneous Source Location - Konstantin Andreev Charles (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 1995.
Designing Overlay Multicast Networks For Streaming - Konstantin Andreev Bruce (2003) (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 1998.
Near-optimal Nonmyopic Value of Information in Graphical.. - Andreas Krause Carlos (2005) (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634 -- 652, July 1998.
A Bidding Protocol for Deploying Mobile Sensors - Guiling Wang Guohong (2003) (2 citations) (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Proc. 28th ACM Annual Symp. on Theory of Computing, 314-318, 1996.
Software Engineering within a Digital Business Ecosystem - Marcon, Corallo, De.. (2006) (Correct)
No context found.
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4) (1998) 634--652
Hardness of Optimal Spaced Seed Design - Nicolas, Rivals (2005) (1 citation) (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the Association for Computing Machinery, 45(4):634--652, 1998.
Confronting Hardness Using a Hybrid Approach - Vassilevska, Williams, Woo (2005) (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634--652, 1998.
Design and Analysis of Secure Encryption Schemes - Abdalla (2001) (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the Association for Computing Machinery, 45(4):634--652, 1998.
Beyond Independent Relevance: Methods and Evaluation.. - Zhai, Cohen, Lafferty (2003) (3 citations) (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634--652, July 1998.
Ad-Hoc and Sensor Networks: Worst-Case vs. Average-Case - Wattenhofer (Correct)
No context found.
U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634--652, 1998.
The Pattern Ordering Problem - Mielikäinen, Mannila (Correct)
No context found.
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45 (1998) 634 -- 652
Radio Network Clustering from Scratch - Kuhn, Moscibroda, Wattenhofer (2004) (Correct)
No context found.
U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634--652, 1998.
Tiling Databases - Floris Geerts Bart (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the Association for Computing Machinery, 45(4):634 -- 652, 1998.
Initializing Newly Deployed Ad Hoc and Sensor Networks - Kuhn, Moscibroda, Wattenhofer (2004) (Correct)
No context found.
U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634--652, 1998.
Constant-Time Distributed Dominating Set Approximation - Kuhn, Wattenhofer (2003) (7 citations) (Correct)
No context found.
U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634--652, 1998.
Algorithmic Construction of Sets for k-Restrictions.. - Alon, Moshkovitz, Safra (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. In Proc. 28th ACM Symp. on Theory of Computing, pages 314--318, 1996.
PatternHunter II: Highly Sensitive and Fast Homology Search - Li, Ma, Kisman, Tromp (2003) (8 citations) (Correct)
No context found.
Feige, U., A threshold of ln n for approximating set cover, Journal of the ACM, 45(4):634--652, 1998.
Tiling Databases - Floris Geerts Bart (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the Association for Computing Machinery, 45(4):634 -- 652, 1998.
Reduced Error Pruning of branching programs cannot be.. - Nock, Elomaa, Kääriäinen (2003) (Correct)
No context found.
U. Feige, A threshold of ln n for approximating set cover, J. ACM 45 (4) (1998) 634--652.
Tiling Databases - Geerts, Goethals, Mielikäinen (Correct)
No context found.
U. Feige. A threshold of ln n for approximating set cover. Journal of the Association for Computing Machinery, 45(4):634 -- 652, 1998.
Radio Network Clustering from Scratch - Kuhn, Moscibroda, Wattenhofer (2004) (Correct)
No context found.
U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634--652, 1998.
Decision Trees: More Theoretical Justification for Practical.. - Fiat, Pechyony (Correct)
No context found.
U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM 45(4):634-652, 1998.
Initializing Newly Deployed Ad Hoc and Sensor Networks - Fabian Kuhn Networks (2004) (Correct)
No context found.
U. Feige. A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634--652, 1998.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC