Demand Hitting and Covering of Intervals

Krupa, Datta R and Roy, Aniket Basu and De, Minati and Govindarajan, Sathish (2017) Demand Hitting and Covering of Intervals. In: 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), FEB 16-18, 2017, Sancoale, INDIA, pp. 267-280.

PDF Alg_Dis_App_10156-267_2017.pdf - Published Version Restricted to Registered users only Download (334kB) | Request a copy

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.

Item Type:	Conference Paper
Series.:	Lecture Notes in Computer Science
Publisher:	10.1007%2F978-3-319-53007-9_24
Additional Information:	3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Sancoale, INDIA, FEB 16-18, 2017 Copy right for this article belongs to the SPRINGER INTERNATIONAL PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	12 Jan 2018 06:38
Last Modified:	12 Jan 2018 06:38
URI:	http://eprints.iisc.ac.in/id/eprint/58766

Actions (login required)

View Item