External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

S. Mishra

This author has not been identified. Look up 'S. Mishra' in Google

Jaikumar Radhakrishnan

This author has not been identified. Look up 'Jaikumar Radhakrishnan' in Google

Sivaramakrishnan Sivasubramanian

This author has not been identified. Look up 'Sivaramakrishnan Sivasubramanian' in Google
runs on