Approximation and Competitive Algorithms for Single-Minded Selling Problem-Reference-Cited by-同舟云学术

Approximation and Competitive Algorithms for Single-Minded Selling Problem

Published:2018 Issue: Volume: Page:98-110
ISSN:0302-9743
Container-title:Algorithmic Aspects in Information and Management
language:
Short-container-title:

Author:

Chin Francis Y. L.,Poon Sheung-Hung,Ting Hing-Fung,Xu Dachuan,Yu Dongxiao,Zhang Yong

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-04618-7_9

Reference13 articles.

1. Bansal, N., Chen, N., Cherniavsky, N., Rurda, A., Schieber, B., Sviridenko, M.: Dynamic pricing for impatient bidders. ACM Trans. Algorithms 6(2), 35 (2010)

2. Briest, P., Krysta, P.: Buying cheap is expensive: hardness of non-parametric multi-product pricing. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 716–725, 07–09 January 2007, New Orleans, Louisiana

3. Lecture Notes in Computer Science;P Chalermsook,2012

4. Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Independent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnesses. In: Proceedings of FOCS 2013, pp. 370–379 (2013)

5. Chen, N., Ghosh, A., Vassilvitskii, S.: Optimal envy-free pricing with metric substitutability. In: Proceedings of the 9th ACM conference on Electronic commerce (EC 2008), pp. 60–69 (2008)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Worst-Case Welfare of Item Pricing in the Tollbooth Problem;Proceedings of the ACM Web Conference 2023;2023-04-30

2. Algorithmic Pricing for the Partial Assignment;Combinatorial Optimization and Applications;2019