On the Hardness of Approximating Minimum Monopoly Problems

S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian. On the Hardness of Approximating Minimum Monopoly Problems. In Manindra Agrawal, Anil Seth, editors, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings. Volume 2556 of Lecture Notes in Computer Science, pages 277-288, Springer, 2002. [doi]

Abstract

Abstract is missing.