Computer Science ›› 2007, Vol. 34 ›› Issue (9): 12-15.

Previous Articles     Next Articles

MA Zhen-Yu, WANG Jian-Xin, FENG Qi-Long, CHEN Jian-Er (School of Information Science and Engineering, Central South University, Changsha 410083)   

  • Online:2018-11-16 Published:2018-11-16

Abstract: Set packing problem is originated from the application of cutting problem which is to divide the elements under strong constraint condition. In complexity theory, set packing problems is an important NP-hard problem, which is used widely in the fields of

Key words: Set Packing problem, NP-hard problem, Complexity theory, Parameterized computation

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!