Broadcasting is a basic network communication task, where a message initially held by a
source node has to be disseminated to all other nodes in the network. Fast algorithms for …

We prove semilogarithmic inapproximability for a maximization problem called unique
coverage: given a collection of sets, find a subcollection that maximizes the number of …

We study the size of memory of mobile agents that permits to solve deterministically the
rendezvous problem, ie, the task of meeting at some node, for two identical agents moving …

It is well known that any graph admits a crossing-free straight-line drawing in R^ 3 and that
any planar graph admits the same even in R^ 2. For a graph G and d ∈ {2, 3\}, let ρ^ 1_d (G) …

Motivated by topology control in ad hoc wireless networks, Power Assignment is a family of
problems, each defined by a certain connectivity constraint (such as strong connectivity) …

We investigate the problem of sharing the cost of a multicast transmission in a wireless
network where each node (radio station) of the network corresponds to (a set of) user (s) …

Power assignment in wireless ad hoc networks can be seen as a family of problems in which
the task is to find in a given power requirement network a minimum power communication …

We consider the problem of assigning powers to nodes of a wireless network in the plane
such that a message from a source node s reaches all other nodes within a bounded …

In this paper, we present approximation algorithms for a variety of problems occurring in the
design of energy-efficient wireless communication networks. We first study the k-station …

This paper studies asymmetric power assignments in wireless ad hoc networks. The
temporary, unfixed physical topology of wireless ad hoc networks is determined by the …