Abstract
In this paper we focus on problems characterized by an input n-node tree and a collection of subpaths. Motivated by the fact that some of these problems admit a very good approximation (or even a poly-time exact algorithm) when the input tree is a path, we develop a decomposition theorem of trees into paths. Our decomposition allows us to partition the input problem into a collection of O(loglogn) subproblems, where in each subproblem either the input tree is a path or there exists a hitting set F of edges such that each path has a non-empty, small intersection with F. When both kinds of subproblems admit constant approximations, our method implies an O(loglogn) approximation for the original problem.
We illustrate the above technique by considering two natural problems of the mentioned kind, namely Uniform Tree Tollbooth and Unique Tree Coverage. In Uniform Tree Tollbooth each subpath has a budget, where budgets are within a constant factor from each other, and we have to choose non-negative edge prices so that we maximize the total price of subpaths whose budget is not exceeded. In Unique Tree Coverage each subpath has a weight, and the goal is to select a subset X of edges so that we maximize the total weight of subpaths containing exactly one edge of X. We obtain O(loglogn) approximation algorithms for both problems. The previous best approximations are O(logn/loglogn) by Gamzu and Segev [ICALP’10] and O(logn) by Demaine et al. [SICOMP’08] for the first and second problem, respectively, however both previous results were obtained for much more general problems with arbitrary budgets (weights).
The first two authors are partially supported by the ERC Starting Grant NEWNET 279352, whereas the third and fifth author are partially supported by the ERC Starting Grant PAAl 259515.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balcan, M.-F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. In: ACM Conference on Electronic Commerce, pp. 29–35 (2006)
Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: ACM Symposium on Theory of Computing (STOC), pp. 721–729 (2006)
Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1093–1102 (2006)
Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salavatipour, M.R.: Combination can be hard: Approximability of the unique coverage problem. SIAM Journal on Computing 38(4), 1464–1483 (2008)
Elbassioni, K., Raman, R., Ray, S., Sitters, R.: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 275–286. Springer, Heidelberg (2009)
Elbassioni, K.M., Sitters, R.A., Zhang, Y.: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 451–462. Springer, Heidelberg (2007)
Gamzu, I., Segev, D.: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. Part I. LNCS, vol. 6198, pp. 582–593. Springer, Heidelberg (2010)
Grandoni, F., Rothvoß, T.: Pricing on paths: A ptas for the highway problem. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 675–684 (2011)
Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1164–1173 (2005)
Guruswami, V., Trevisan, L.: The Complexity of Making Unique Choices: Approximating 1-in-k SAT. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 99–110. Springer, Heidelberg (2005)
Hartline, J.D., Koltun, V.: Near-Optimal Pricing in Near-Linear Time. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 422–431. Springer, Heidelberg (2005)
Khandekar, R., Kimbrel, T., Makarychev, K., Sviridenko, M.: On Hardness of Pricing Items for Single-Minded Bidders. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 202–216. Springer, Heidelberg (2009)
Popat, P., Wu, Y.: On the hardness of pricing loss-leaders. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 735–749 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cygan, M., Grandoni, F., Leonardi, S., Pilipczuk, M., Sankowski, P. (2012). A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)