- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
- Algorithmica
- 2006

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… (More)

- Reuven Bar-Yehuda, Michael Beder, Dror Rawitz
- Algorithmica
- 2016

We study the storage allocation problem (SAP) which is a variant of the unsplittable flow problem on paths (UFPP). A SAP instance consists of a path $$P = (V,E)$$P=(V,E) and a set J of tasks. Each… (More)

- Reuven Bar-Yehuda, Michael Beder, Dror Rawitz
- SPAA
- 2013

We study the <i>Storage Allocation Problem (SAP)</i> which is a variant of the <i>Unsplittable Flow Problem on Paths (UFPP)</i>. A <i>SAP</i> instance consists of a path <i>P = (V,E)</i> and a set… (More)

We discuss two NP-hard allocation problems, the Bandwidth Allocation Problem (BAP) and the Storage Allocation Problem (SAP). In BAP we are given a set of requests, each of which is associated with a… (More)

- Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
- ESA
- 2006

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… (More)

- Michael Beder
- 2013

1