%0 Conference Paper %1 conf/fsttcs/MishraRS02 %A Mishra, S. %A Radhakrishnan, Jaikumar %A Sivasubramanian, Sivaramakrishnan %B FSTTCS %D 2002 %E Agrawal, Manindra %E Seth, Anil %I Springer %K dblp %P 277-288 %T On the Hardness of Approximating Minimum Monopoly Problems. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2002.html#MishraRS02 %V 2556 %@ 3-540-00225-1

@inproceedings{conf/fsttcs/MishraRS02, added-at = {2017-05-24T00:00:00.000+0200}, author = {Mishra, S. and Radhakrishnan, Jaikumar and Sivasubramanian, Sivaramakrishnan}, biburl = {https://www.bibsonomy.org/bibtex/2ce72b588b0311421536836cf9bbe8bef/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/2002}, editor = {Agrawal, Manindra and Seth, Anil}, ee = {https://doi.org/10.1007/3-540-36206-1_25}, interhash = {537d88af12034873b31aeacb9a15f04d}, intrahash = {ce72b588b0311421536836cf9bbe8bef}, isbn = {3-540-00225-1}, keywords = {dblp}, pages = {277-288}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:09:09.000+0200}, title = {On the Hardness of Approximating Minimum Monopoly Problems.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2002.html#MishraRS02}, volume = 2556, year = 2002 }