Approximating the minimum maximal independence number

Information Processing Letters - Tập 46 - Trang 169-172 - 1993
Magnús M. Halldórsson1
1School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-12, Japan

Tài liệu tham khảo

Arora, 1992, Proof verification and hardness of approximation problems, Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science, 10.1109/SFCS.1992.267823 Irving, 1991, On approximating the minimum independent dominating set, Inform. Process. Lett., 37, 197, 10.1016/0020-0190(91)90188-N Kann, 1992, Polynomially bounded minimization problems which are hard to approximate, Manuscript
Thông tin
Thông tin xuất bản

Information Processing Letters

Tập 46

169-172

Thông tin tác giả