- Fast Information Spreading in Graphs with a Large Weak Conductance
- On Lagrangian Relaxation and Subset Selection Problems (Extended Abstract)
- set of transactions sequentially: a new transaction will be sent once the previous one has been completed by
- for Multimedia Scheduling Schemes''. IBM Research Report RC20038, April 1995. [15] W. Sincoskie, ''System Architecture for Large Scale Video on Demand'', Computer Networks
- the expected loss of users (due to reneging) is bounded by a given 0 ff ! 1.
- Maximizing Submodular Set Functions Subject to Multiple Linear Constraints Ariel Kulik
- SELF-ORGANIZING LISTS AND INDEPENDENT REFERENCES --A STATISTICAL SYNERGY
- [1] Bitner, J., ``Heuristics that Dynamically Organize Data Structures'', SIAM J. Comput., 8,#1, pp. 82110, 1979.
- Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
- [16] M. Naor and L. Stockmeyer. ``What can be computed locally?'' 25th ACM Symposium on Theory of Computing, 1993, pp. 184--193.
- Batch Coloring Flat Graphs and Thin Magnus M. Halldorsson
- 10 25 50 75 100 Arrival Rate (per Min.)
- Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks
- ON THE OPTIMALITY OF THE COUNTER SCHEME FOR DYNAMIC LINEAR LISTS
- [3] GELENBE, E., AND MITRANI, I. Analysis and Synthesis of Computer Sys tems. Academic Press, 1980. Ch. 2, Section 2.2.
- Approximation Algorithms for Packing Resizable Items and Covering by Holes
- There is No EPTAS for Two-dimensional Knapsack Ariel Kulik
- Minimal Cost Reconfiguration of Data Placement in Storage Area Hadas Shachnai
- On Rank Aggregation of Multiple Orderings in Network Design Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel
- !"$#&%')(102354 687@9BADCFEGIHPRQ89IS5T UVGIWYXa`bdc UfehgGpiqisr`9BH cDc 9YXdt u b Swv9YHxA c GIHDCIy
- Efficient Reorganization of Binary Search Trees Micha Hofri
- The List Update Problem: Improved Bounds for the Counter Scheme
- Partial Information Spreading with Application to Distributed Maximum Coverage
- 1 2
- Minimizing Busy Time in Multiple Machine Real-time Scheduling
- Itai, Shachnai: Adaptive Source Routing.. 25 Proof of Lemma 1: The network topology implies, that any link emanating from s belongs to a
- are labeled LPT Average. Both versions of the algorithm maintain the same worst case bound.
- n n ffl 0.05 0.1 0.15 0.2 10 7.73 6.53 6.06 5.37
- THE APPLICATION OF RESTRICTED COUNTER SCHEMES TO THREE MODELS OF LINEAR SEARCH
- ffl if V ? jU j, then add one dummy set of size V \Gamma jU j, to obtain an instance, in which V = jU j. After placing the items in the knapsacks, omit the `dummy' items.
- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints
- Corrigendum: Improved Results for Data Migration and Open Shop Scheduling
- A Theory and Algorithms for Combinatorial Reoptimization
- Parameterized Approximation via Fidelity Preserving Transformations
- All-or-Nothing Generalized Assignment with Applications to Scheduling Advertising Campaigns
