局部改良手法における離散族問題の近似
スポンサーリンク
概要
- 論文の詳細を見る
We consider further a local search technique with which we obtaind improved apporoximations for the Set Paking problem.We obtain improved approximation for the Set Cover problem,Graph Coloring problem with a complementary objective function,and the Induced k-Colorable Subgraph ploblem.
- 社団法人電子情報通信学会の論文
- 1994-09-22