#### Filter Results:

- Full text PDF available (137)

#### Publication Year

1988

2017

- This year (3)
- Last 5 years (36)
- Last 10 years (89)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

#### Organism

Learn More

- R Cohen, K Erez, D ben-Avraham, S Havlin
- Physical review letters
- 2001

We study the tolerance of random networks to intentional attack, whereby a fraction p of the most connected sites is removed. We focus on scale-free networks, having connectivity distribution P(k) approximately k(-alpha), and use percolation theory to study analytically and numerically the critical fraction p(c) needed for the disintegration of the network,… (More)

- Reuven Cohen, Shlomo Havlin, Daniel Ben-Avraham
- Physical review letters
- 2003

We present an effective immunization strategy for computer networks and populations with broad and, in particular, scale-free degree distributions. The proposed strategy, acquaintance immunization, calls for the immunization of random acquaintances of random nodes (individuals). The strategy requires no knowledge of the node degrees or any other global… (More)

- Reuven Cohen, Liran Katzir, Danny Raz
- Inf. Process. Lett.
- 2006

We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the knapsack problem into an approximation algorithm for GAP. If the approximation ratio of the knapsack algorithm is α and its running time is O(f (N)), our algorithm guarantees a (1… (More)

Examining important results and analytical techniques, this graduate-level textbook is a step-by-step presentation of the structure and function of complex networks. From the stability of the Internet to efficient methods of immunizing populations, from epidemic spreading to how to efficiently search for individuals, this textbook explains the theoretical… (More)

- Reuven Cohen, Shlomo Havlin
- Physical review letters
- 2003

We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) proportional, variant k(-lambda), i.e., the probability of having k links outgoing from a site. In contrast to the diameter of regular random networks or small-world networks, which is known to be d approximately ln(N, we show,… (More)

- Reuven Cohen, David Peleg
- ESA
- 2004

This paper considers the convergence problem in autonomous mobile robot systems. A natural algorithm for the problem requires the robots to move towards their center of gravity. This paper proves the correctness of the gravitational algorithm in the fully asynchronous model. It also analyzes its convergence rate and establishes its convergence in the… (More)

- Reuven Cohen, Liran Katzir
- Inf. Process. Lett.
- 2008

We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 + )-approximation for every > 0, and then use partial enumeration to reduce the… (More)

- Sebastian Neumayer, Gil Zussman, Reuven Cohen, Eytan Modiano
- IEEE/ACM Transactions on Networking
- 2009

Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an electromagnetic pulse (EMP) attack. Such real-world events happen in specific geographical locations and disrupt specific parts of the network. Therefore, the geographical layout of the network determines the impact of such… (More)

- Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg
- ACM Trans. Algorithms
- 2005

A finite automaton, simply referred to as a <i>robot</i>, has to explore a graph, that is, visit all the nodes of the graph. The robot has no a priori knowledge of the topology of the graph, nor of its size. It is known that for any <i>k</i>-state robot, there exists a graph of maximum degree 3 that the robot cannot explore. This article considers the… (More)

- Reuven Cohen, Boris Kapchits
- IEEE/ACM Transactions on Networking
- 2009

This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm is optimal and requires simple computing operations that can be implemented by simple devices. To the best of our knowledge, this is the first paper to propose a sensor wake-up… (More)