A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
暂无分享,去创建一个
Piotr Sankowski | Fabrizio Grandoni | Marcin Pilipczuk | Stefano Leonardi | Marek Cygan | P. Sankowski | S. Leonardi | Marek Cygan | Marcin Pilipczuk | F. Grandoni
[1] Michael Hoffmann,et al. Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings , 2007, ESA.
[2] Khaled M. Elbassioni,et al. On Profit-Maximizing Pricing for the Highway and Tollbooth Problems , 2009, SAGT.
[3] Tracy Kimbrel,et al. On Hardness of Pricing Items for Single-Minded Bidders , 2009, APPROX-RANDOM.
[4] Yan Zhang,et al. A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs , 2007, ESA.
[5] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[6] Venkatesan Guruswami,et al. The Complexity of Making Unique Choices: Approximating 1-in- k SAT , 2005, APPROX-RANDOM.
[7] Baruch Schieber,et al. A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.
[8] Preyas Popat,et al. On the hardness of pricing loss-leaders , 2012, SODA.
[9] Danny Segev,et al. A Sublogarithmic Approximation for Highway and Tollbooth Pricing , 2010, ICALP.
[10] Vladlen Koltun,et al. Near-Optimal Pricing in Near-Linear Time , 2005, WADS.
[11] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.
[12] Venkatesan Guruswami,et al. On profit-maximizing envy-free pricing , 2005, SODA '05.
[13] Fabrizio Grandoni,et al. Pricing on paths: a PTAS for the highway problem , 2011, SODA '11.
[14] Sorin C. Popescu,et al. Lidar Remote Sensing , 2011 .
[15] Erik D. Demaine,et al. Combination can be hard: approximability of the unique coverage problem , 2006, SODA '06.
[16] Piotr Krysta,et al. Single-minded unlimited supply pricing on sparse instances , 2006, SODA '06.
[17] Maria-Florina Balcan,et al. Approximation Algorithms and Online Mechanisms for Item Pricing , 2007, Theory Comput..