Euiwoong Lee. Hardness of Graph Pricing Through Generalized Max-Dicut. In Rocco A. Servedio, Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. pages 391-399, ACM, 2015. [doi]
@inproceedings{Lee15-33, title = {Hardness of Graph Pricing Through Generalized Max-Dicut}, author = {Euiwoong Lee}, year = {2015}, doi = {10.1145/2746539.2746549}, url = {http://doi.acm.org/10.1145/2746539.2746549}, researchr = {https://researchr.org/publication/Lee15-33}, cites = {0}, citedby = {0}, pages = {391-399}, booktitle = {Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, publisher = {ACM}, isbn = {978-1-4503-3536-2}, }