Dynamic programming based algorithms for set multicover and multiset multicover problems

Theoretical Computer Science

Volumn 411, Issue 26-28, 2010, Pages 2467-2474

  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; Dynamic programming; Inclusion exclusion; Multiset multicover; Set multicover

Indexed keywords

CONSTRUCTIVE ALGORITHMS; EXACT ALGORITHMS; HARD PROBLEMS; INCLUSION-EXCLUSION; MAXIMUM COVERAGE; MULTI-SETS; MULTIPLICITY CONSTRAINTS; MULTISET; MULTISET MULTICOVER; NETHERLANDS; POLYNOMIAL SPACE; THEORETICAL COMPUTER SCIENCE;

ALGORITHMS;

DYNAMIC PROGRAMMING;

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

References (27)

1. S. Albers, S. Arora, S. Khanna, Page replacement for general caching problems, in: Proc. SODA, Baltimore, Maryland, US, 1999, pp. 31-40.
2. D. Amzallag, R. Engelberg, J. Naor, D. Raz, Capacitated cell planning of 4G cellular networks, Technical Report CS-2008-04, Computer Science Department, Technion, Haifa 32000, Israel, 2008.
3. E. Angel, E. Bampis, F. Pascual, Traffic grooming in a passive star WDM network, in: Proc. SIROCCO, 2004, pp. 1-12.
4. Bar-Noy A., Halldórsson M.M., Kortsarz G., Salman R., and Shachnai H. Sum multicoloring of graphs. Journal of Algorithms 37 2 (2000) 422-450
5. Björklund A., Husfeldt T., and Koivisto M. Set partitioning via Inclusion-Exclusion. SIAM Journal on Computing 39 2 (2009) 546-563
6. 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, CA, USA, 2007.
7. Chuzhoy J., and Naor J. Covering problems with hard capacities. SIAM Journal on Computing 36 2 (2006) 498-515
8. Forney Jr. G.D. The Viterbi algorithm. Proceedings of the IEEE 61 3 (1973) 268-278
9. Gandhi R., Halperin E., Khuller S., Kortsarz G., and Srinivasan A. An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences 72 1 (2006) 16-33
10. Hall N.G., and Hochbaum D.S. A fast approximation algorithm for the multicovering problem. Discrete Applied Mathematics 15 1 (1986) 35-40
11. Hochbaum D.S., and Levin A. Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discrete Optimization 3 4 (2006) 327-340
12. Hochbaum D.S. Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-Hard Problems (1996), PWS Publishing Co., Boston, MA, USA 94-143
13. Q.-S. Hua, D. Yu, F.C.M. Lau, Y. Wang, Exact algorithms for set multicover and multiset multicover problems, in: Proc. 20th International Symposium on Algorithms and Computation, ISAAC, Hawaii, USA, 2009.
14. Hua Q.-S., Wang Y., Yu D., and Lau F.C.M. Set multi-covering via inclusion-exclusion. Theoretical Computer Science 410 38-40 (2009) 3882-3892
15. Q.-S. Hua, D. Yu, F.C.M. Lau, Y. Wang, Exact Algorithms for Counting k-Set Multicover and Counting k-Multiset Multicover Problems, manuscript, 2009.
16. 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, 2008.
17. Karger D., Stein C., and Wein J. Scheduling algorithms. Algorithms and Theory of Computation Handbook (1999), CRC, Boca Raton, Fla
18. Kolliopoulos S.G., and Young N.E. Approximation algorithms for covering/packing integer programs. Journal of Computer and System Sciences 71 4 (2005) 495-505
19. Kolliopoulos S.G. Approximation algorithms for covering integer programs with multiplicity constraints. Discrete Applied Mathematics 129 (2003) 461-473
20. Leung J.Y.-T., Li H., and Pinedo M. Scheduling orders for multiple product types with due date related objectives. European Journal of Operational Research 168 2 (2006) 370-389
21. J. Nederlof, Inclusion Exclusion for hard problems, Master Thesis, Utrecht University, The Netherlands, 2008.
22. Plotkin S.A., Shmoys D.B., and Tardos E. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20 2 (1995) 257-301
23. 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
24. A. Srinivasan, New approaches to covering and packing problems, in: Proc. 12th SODA, Washington, DC, USA, 2001.
25. Srinivasan A. Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing 29 2 (1999) 648-670
26. H. Shachnai, O. Shmueli, R. Sayegh, Approximation Schemes for deal splitting and covering integer programs with multiplicity constraints, in: Proc. WAOA, 2004, pp. 111-125.
27. Vazirani V.V. Approximation Algorithms (2003), Springer, Berlin