Advertisement

Resource Allocation for Covering Time Varying Demands

  • Venkatesan T. Chakaravarthy
  • Amit Kumar
  • Sambuddha Roy
  • Yogish Sabharwal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6942)

Abstract

We consider the problem of allocating resources to satisfy demand requirements varying over time. The input specifies a demand for each timeslot. Each resource is specified by a start-time, end-time, an associated cost and a capacity. A feasible solution is a multiset of resources such that at any point of time, the sum of the capacities offered by the resources is at least the demand requirement at that point of time. The goal is to minimize the total cost of the resources included in the solution. This problem arises naturally in many scenarios such as workforce management, sensor networks, cloud computing, energy management and distributed computing. We study this problem under the partial cover setting and the zero-one setting. In the former scenario, the input also includes a number k and the goal is to choose a minimum cost solution that satisfies the demand requirements of at least k timeslots. For this problem, we present a 16-approximation algorithm; we show that there exist “well-structured” near-optimal solutions and that such a solution can be found in polynomial time via dynamic programming. In the zero-one setting, a feasible solution is allowed to pick at most one copy of any resource. For this case, we present a 4-approximation algorithm; our algorithm uses a novel LP relaxation involving flow-cover inequalities.

Keywords

Feasible Solution Cloud Computing Full Cover Vertex Cover Constant Factor Approximation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: STOC (2006)Google Scholar
  2. 2.
    Bonsma, P., Schulz, J., Wiese, A.: A constant factor approximation algorithm for unsplittable flow on paths. In: FOCS (2011)Google Scholar
  3. 3.
    Carnes, T., Shmoys, D.: Primal-dual schema for capacitated covering problems. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 288–302. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Chakaravarthy, V., Kumar, A., Parija, G., Roy, S., Sabharwal, Y.: Minimum cost resource allocation for meeting job requirements. In: IPDPS (2011)Google Scholar
  5. 5.
    Chakrabarty, D., Grant, E., Könemann, J.: On column-restricted and priority covering integer programs. In: IPCO (2010)Google Scholar
  6. 6.
    Chekuri, C., Mydlarz, M., Shepherd, F.: Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms 3(3) (2007)Google Scholar
  7. 7.
    Dhesi, A., Gupta, P., Kumar, A., Parija, G., Roy, S.: Contact center scheduling with strict resource requirements. In: IPCO (2011)Google Scholar
  8. 8.
    Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55–84 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Garg, N.: Saving an ε: a 2-approximation for the k-MST problem in graphs. In: STOC, pp. 396–402 (2005)Google Scholar
  10. 10.
    Golovin, D., Nagarajan, V., Singh, M.: Approximating the k-multicut problem. In: SODA (2006)Google Scholar
  11. 11.
    Ibarra, O., Kim, C.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22, 463–468 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Ingolfsson, A., Campello, F., Wu, X., Cabral, E.: Combining Integer Programming and the Randomization Method to Schedule Employees. European J. Operations Research 202(1), 153–163 (2010)CrossRefzbMATHGoogle Scholar
  13. 13.
    Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2), 274–296 (2001)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Venkatesan T. Chakaravarthy
    • 1
  • Amit Kumar
    • 2
  • Sambuddha Roy
    • 1
  • Yogish Sabharwal
    • 1
  1. 1.IBM Research - IndiaNew DelhiIndia
  2. 2.Indian Institute of TechnologyNew DelhiIndia

Personalised recommendations