#### Filter Results:

#### Publication Year

1997

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We study the approximation complexity of certain kinetic variants of the Trav-eling Salesman Problem where we consider instances in which each point moves with a xed constant speed in a xed direction. We prove the following results. 1. If the points all move with the same velocity, then there is a PTAS for the Kinetic TSP. 2. The Kinetic TSP cannot be… (More)

A box-tree is a \ifasci so-called \emph{bounding-volume hierarchy} \else bounding-volume hierarchy \fi that uses axis-aligned boxes as bounding volumes. The query complexity of a box-tree with respect to a given type of query is the maximum number of nodes visited when answering such a query. We describe several new algorithms for constructing box-trees… (More)

We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is inspired by the recently introduced variation of greedy routing, called neighbor–of–neighbor (NoN), which allows to get optimal average path length with respect to the degree. Our… (More)

Summary form only given. We study on-demand source initiated protocols for mobile wireless networks. In particular, we study the flooding procedure commonly used by these protocols to set up temporary communication paths. The benefit of the flooding technique is its generosity regarding changes in network structure. On the other hand, each time a message is… (More)

- Aaa, I Abraham, B Awerbuch, Y Azar, Y Bartal, D Malkhi +68 others

[A02] K Aberer. Scalable data access in peer-to-peer systems using unbalanced search trees. E Pavlov. A generic scheme for building overlay networks in adversarial scenarios. process on the hypercube with applications to peer-to-peer networks. Proc. [AN86] M Aizenman and C M Newman. Discontinuity of the percolation density in one dimensional 1/|x − y| 2… (More)

Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices. We investigate the existence of these spanning subgraphs in analogy to classical studies of Hamiltonicity.