摘要
Case Packing is a famous NP problem. Author designed a approximate algorithm to solve this problem. This algorithm can analyze the performance bounds more deeply than traditional algorithms. Also, it has a good worst case performance bounds.
Case Packing is a famous NP problem. Author designed a approximate algorithm to solve this problem. This algorithm can analyze the performance bounds more deeply than traditional algorithms. Also, it has a good worst case performance bounds.
出处
《四川大学学报（自然科学版）》
CAS
CSCD
北大核心
2003年第2期392-394,共3页
Journal of Sichuan University(Natural Science Edition)
