Skip to main content
SpringerLink
Log in

Resource Allocation in Bounded Degree Trees

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in the tree, a bandwidth requirement, and a weight. Our goal is to find a maximum weight subset S of requests such that, for every edge e, the total bandwidth of requests in S whose path contains e is at most 1. We also consider the storage allocation problem (sap), in which it is also required that every request in the solution is given the same contiguous portion of the resource in every edge in its path. We present a deterministic approximation algorithm for bap in bounded degree trees with ratio \((2\sqrt{e}-1)/(\sqrt{e}-1)+\varepsilon<3.542\) . Our algorithm is based on a novel application of the local ratio technique in which the available bandwidth is divided into narrow strips and requests with very small bandwidths are allocated in these strips. We also present a randomized (2+ε)-approximation algorithm for bap in bounded degree trees. The best previously known ratio for bap in general trees is 5. We present a reduction from sap to bap that works for instances where the tree is a line and the bandwidths are very small. It follows that there exists a deterministic 2.582-approximation algorithm and a randomized (2+ε)-approximation algorithm for sap in the line. The best previously known ratio for this problem is 7.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18, 1–8 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289–297 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: 38th Annual ACM Symposium on the Theory of Computing, pp. 721–729, 2006

  4. Bar-Noy, A., Canetti, R., Kutten, S., Mansour, Y., Schieber, B.: Bandwidth allocation with preemption. SIAM J. Comput. 28(5), 1806–1828 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Shieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069–1090 (2001)

    Article  MathSciNet  Google Scholar 

  6. Bar-Yehuda, R.: One for the price of two: a unified approach for approximating covering problems. Algorithmica 27(2), 131–144 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discrete Math. 25, 27–46 (1985)

    MathSciNet  Google Scholar 

  8. Buchsbaum, A.L., Karloff, H., Kenyon, C., Reingold, N., Thorup, M.: OPT versus LOAD in dynamic storage allocation. SIAM J. Comput. 33(3), 632–646 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Calinescu, G., Chakrabarti, A., Karloff, H.J., Rabani, Y.: Improved approximation algorithms for resource allocation. In: 9th International Integer Programming and Combinatorial Optimization Conference. LNCS, vol. 2337, pp. 401–414 (2002)

  10. Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. In: 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS, vol. 2462, pp. 51–66 (2002)

  11. Chekuri, C., Mydlarz, M., Shepherd, B.: Multicommodity demand flow in a tree. In: 30th Annual International Colloquium on Automata, Languages and Programming. LNCS, vol. 2719, pp. 410–425 (2003)

  12. Chen, B., Hassin, R., Tzur, M.: Allocation of bandwidth and storage. IIE Trans. 34, 501–507 (2002)

    Google Scholar 

  13. Fekete, S.P., Khuller, S., Klemmstein, M., Raghavachari, B., Young, N.: A network-flow technique for finding low-weight bounded-degree spanning trees. J. Algorithms 24(2), 310–324 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gergov, J.: Algorithms for compile-time memory optimization. In: 10th Annual Symposium on Discrete Algorithms, pp. 907–908, 1999

  15. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, San Diego (1980)

    MATH  Google Scholar 

  16. Kumar, S.R., Panigrahy, R., Russell, A., Sundaram, R.: A note on optical routing on trees. Inf. Process. Lett. 62(6), 295–300 (1997)

    Article  MathSciNet  Google Scholar 

  17. Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A.: Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In: 20th Conference on Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 1974, pp. 409–420 (2000)

  18. Lewin-Eytan, L., Naor, J., Orda, A.: Admission control in networks with advance reservations. Algorithmica 40(4), 293–403 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Phillips, C., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. J. Sched. 3, 365–381 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  20. Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55(2), 221–232 (1985)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion, Haifa, 32000, Israel

    Reuven Bar-Yehuda, Michael Beder & Yuval Cohen

  2. Caesarea Rothschild Institute, University of Haifa, Haifa, 31905, Israel

    Dror Rawitz

Authors
  1. Reuven Bar-Yehuda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Beder
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuval Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dror Rawitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dror Rawitz.

Additional information

A preliminary version of this paper was presented at the 14th Annual European Symposium on Algorithms (ESA), 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bar-Yehuda, R., Beder, M., Cohen, Y. et al. Resource Allocation in Bounded Degree Trees. Algorithmica 54, 89–106 (2009). https://doi.org/10.1007/s00453-007-9121-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9121-7

Keywords

Search

Navigation