ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Hardness of Graph Pricing Through Generalized Max-Dicut
Article URLs:
Alternative Article URLs:
Authors: Euiwoong Lee
  • Carnegie Mellon University
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1115525
DBLP Key: conf/stoc/Lee15
Author Comments:

Discuss this paper and its artifacts below