Searching for authors named "Tami Tamir" – sorted by Relevance.
9 documents found, showing 1 through 9.
-
Polynomial Time Approximation Schemes for Class-Constrained Packing Problems
- … ? and Tami Tamir Dept. of Computer Science, Technion, Haifa, Israel. fhadas…
- Cited by 14 (2 self) – Add To MetaCart
-
Tight bounds for online class-constrained packing
- … Tight Bounds for Online Class-Constrained Packing \Lambda Hadas Shachnai yz Tami Tamir x…
- Cited by 1 (0 self) – Add To MetaCart
-
On Two Class-Constrained Versions of the Multiple Knapsack Problem
- … On Two Class-Constrained Versions of the Multiple Knapsack Problem Hadas Shachnai y Tami Tamir…
- Cited by 16 (4 self) – Add To MetaCart
-
Local Labeling And Resource Allocation Using Preprocessing
- … , AND TAMI TAMIR y Abstract. This paper studies the power of non-restricted preprocessing on a communication…
- Cited by 3 (2 self) – Add To MetaCart
-
On Chromatic Sums and Distributed Resource Allocation
- …'s M. Halldo'rssonz Hadas Shachnaix Tami Tamir- Abstract This paper studies an optimization problem…
- Add To MetaCart
-
On Chromatic Sums and Distributed Resource Allocation
- …. Halld'orsson z Hadas Shachnai x Tami Tamir -- Department of Electrical Engineering, Tel…
- Cited by 44 (13 self) – Add To MetaCart
-
Scheduling Techniques for Media-on-Demand
- …Scheduling Techniques for Media-on-Demand ∗ Amotz Bar-Noy † Richard E. Ladner ‡ Tami Tamir § March…
- Cited by 9 (3 self) – Add To MetaCart
-
Windows Scheduling as a Restricted Version of Bin Packing
- … ‡ Tami Tamir § January 29, 2006 Abstract Given is a sequence of n positive integers w1, w2, . . . , wn…
- Cited by 8 (3 self) – Add To MetaCart
-
Semi-matchings for bipartite graphs and load balancing
- … László Lovász c Tami Tamir d a MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA…
- Cited by 5 (0 self) – Add To MetaCart
Showing 1 through 9.
