Abstract
Hitting and Covering problems have been extensively studied in the last few decades and have applications in diverse areas. While the hitting and covering problems are NP-hard for most settings, they are polynomial solvable for intervals. Demand hitting is a generalization of the hitting problem, where there is an integer demand associated with each object, and the demand hitting set must contain at least as many points as the demand of each object. In this paper, we consider the demand hitting and covering problems for intervals that have no containment. For the unweighted setting, we give a simple greedy algorithm. In the weighted setting, we model this problem as a min-cost max flow problem using a non-trivial reduction and solve it using standard flow algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 145–156. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33090-2_14
Bansal, N., Pruhs, K.: The geometry of scheduling. SIAM J. Comput. 43(5), 1684–1698 (2014)
Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Appl. Math. 59(3), 225–235 (1995). http://www.sciencedirect.com/science/article/pii/0166218X9580003M
Chakrabarty, D., Grant, E., Könemann, J.: On column-restricted and priority covering integer programs. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 355–368. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13036-6_27
Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multicover problem in geometric settings. ACM Trans. Algorithms (TALG) 9(1), 9 (2012)
Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S.M., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4(3), 34:1–34:17 (2008). http://doi.acm.org/10.1145/1367064.1367074
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)
Kleinberg, J., Tardos, É.: Algorithm Design. Pearson Education India, Delhi (2006)
Tarjan, R.E.: 8. network flows. In: Data Structures and Network Algorithms, Chap. 8, pp. 97–112. SIAM (1983). http://epubs.siam.org/doi/abs/10.1137/1.9781611970265.ch8
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Krupa R., D., Basu Roy, A., De, M., Govindarajan, S. (2017). Demand Hitting and Covering of Intervals. In: Gaur, D., Narayanaswamy, N. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2017. Lecture Notes in Computer Science(), vol 10156. Springer, Cham. https://doi.org/10.1007/978-3-319-53007-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-53007-9_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53006-2
Online ISBN: 978-3-319-53007-9
eBook Packages: Computer ScienceComputer Science (R0)