Set multi-covering via inclusion-exclusion

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3882-3892

  Hua, Qiang Sheng ^a   Wang, Yuexuan ^b   Yu, Dongxiao ^a   Lau, Francis C M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Algorithm; Complexity; Inclusion exclusion; Set multi covering

Indexed keywords

COMPLEXITY; COVERING PROBLEMS; EXACT ALGORITHMS; INCLUSION-EXCLUSION; MAXIMUM VALUES; SET COVERING PROBLEM; SET MULTI-COVERING; SET PARTITIONING; TIME AND SPACE;

ALGORITHMS;

SET THEORY;

EID: 68249120272     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.05.020     Document Type: Article

References (11)

1. Bax E.T. Inclusion and exclusion algorithms for the Hamiltonian path problem. Information Processing Letters 47 4 (1993) 203-207
2. A. Björklund, T. Husfeldt, M. Koivisto, Set partitioning via Inclusion-Exclusion. SIAM Journal on Computing, in: FOCS 2006 (in press, special issue)
3. A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, Fourier meets Möbius: fast subset convolution, in: Proc. 39th Annual ACM Symposium on Theory of Computing, STOC, San Diego, California, US, June 2007
4. A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, The travelling salesman problem in bounded degree graphs, in: Proc. 35th ICALP, Iceland, 2008
5. Feige U. A threshold of ln n for approximating set cover. Journal of the ACM 45 4 (1998) 634-652
6. Q.-S. Hua, F.C.M. Lau, Exact and approximate link scheduling algorithms under the physical interference model, in: Proc. 5th SIGACT-SIGOPS International Workshop on Foundation of Mobile computing (DIALM-POMC), Toronto, Canada, Aug. 2008
7. Karp R.M. Dynamic programming meets the principle of inclusion-exclusion. Operations Research Letters 1 2 (1982) 49-51
8. J. Nederlof, Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner Tree and related problems, in: Proc. ICALP 2009 (in press)
9. Radhakrishnan J. Entropy and counting. In: J.C. M. (Ed). IIT Kharagpur Golden Jubilee Volume on Computational Mathematics, Modelling and Algorithms (2001), Narosa Publishers, New Delhi
10. Vazirani V.V. Approximation Algorithms (2003), Springer, Berlin
11. Rajagopalan S., and Vazirani V.V. Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM Journal on Computing 28 2 (1998) 525-540