#### Filter Results:

- Full text PDF available (99)

#### Publication Year

1991

2017

- This year (4)
- Last 5 years (39)
- Last 10 years (66)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We consider the problem of scheduling jobs that are given as <i>groups</i> of non-intersecting segments on the real line. Each job <i>J<inf>j</inf></i> is associated with an interval, <i>I<inf>j</inf>,</i> which consists of up to <i>t</i> segments, for some <i>t</i> ≥ 1, a positive weight, <i>w<inf>j</inf>,</i> and two jobs are in conflict if any of… (More)

- Ariel Kulik, Hadas Shachnai, Tami Tamir
- SODA
- 2009

The concept of submodularity plays a vital role in com-binatorial optimization. In particular, many important optimization problems can be cast as submodu-lar maximization problems, including maximum coverage , maximum facility location and max cut in di-rected/undirected graphs. In this paper we present the first known approximation algorithms for the… (More)

- Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
- ACM Trans. Algorithms
- 2004

The <i>data migration</i> problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. We consider this problem with the objective of minimizing the sum of completion times of all storage devices. It is modeled by a transfer graph, where vertices represent the storage devices, and the edges… (More)

- Joel L. Wolf, Philip S. Yu, Hadas Shachnai
- Multimedia Systems
- 1997

For a video-on-demand computer system, we propose a scheme which balances the load on the disks, thereby helping to solve a performance problem crucial to achieving maximal video throughput. Our load-balancing scheme consists of two components. The static component determines good assignments of videos to groups of striped disks. The dynamic component uses… (More)

- Hadas Shachnai
- 1999

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of diierent classes (colors) need to be placed in bins; the items may have diierent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can hold. In the class-constrained multiple knapsack (CCMK)… (More)

- Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir
- Algorithmica
- 2006

The transactional approach to contention management guarantees atomicity by making sure that whenever two transactions have a conflict on a resource, only one of them proceeds. A major challenge in implementing this approach lies in guaranteeing progress, since transactions are often restarted.Inspired by the paradigm of <i>non-clairvoyant</i> job… (More)

- Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
- Algorithmica
- 2003

We consider the sum coloring and sum multicoloring problems on several fundamental classes of graphs, including the classes of interval and k-claw free graphs. We give an algorithm that approximates sum coloring within a factor of 1.796, for any graph in which the maximum k-colorable subgraph problem is polynomially solvable. In particular, this improves on… (More)

- Keren Censor-Hillel, Hadas Shachnai
- SIAM J. Comput.
- 2011

Gathering data from nodes in a network is at the heart of many distributed applications, most notably, while performing a global task. We consider <i>information spreading</i> among <i>n</i> nodes of a network, where each node <i>v</i> has a message <i>m(v)</i> which must be received by all other nodes. The time required for information spreading has been… (More)

- Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
- ACM Trans. Algorithms
- 2002

We consider the following scheduling with batching problem that has many applications, e.g., in multimedia-on-demand and manufacturing of integrated circuits. The input to the problem consists of <i>n</i> jobs and <i>k</i> parallel machines. Each job is associated with a set of time intervals in which it can be scheduled (given either explicitly or… (More)

- Hadas Shachnai, Meirav Zehavi
- J. Comput. Syst. Sci.
- 2014

Let M = (E, I) be a matroid, and let S be a family of subsets of size p of E.