Physical networks are pervasive in our society. They range from the traditional copper
networks in telecommunications to the modern optical cable networks used for broadband …

We describe MapSets, a method for visualizing embedded and clustered graphs. The
proposed method relies on a theoretically sound geometric algorithm, which guarantees the …

Abstract Minimal Networks Theory is a branch of mathematics that goes back to 17th century
and unites ideas and methods of metric, differential, and combinatorial geometry and …

Abstract In the Continuous Steiner Tree problem (CST), we are given as input a set of points
(called terminals) in a metric space and ask for the minimum-cost tree connecting them …

Abstract In Pickup and Delivery Problems (PDPs), mobile vehicles retrieve and deliver a set
of items. The PDP is a well-studied, NP-hard problem. Examples of the PDP include mail …

We address the Collection and Delivery Problem (CDP) with multiple vehicles, such that
each collects a set of items at different locations and delivers them to a dropoff point. The …

In this paper, we model the data dissemination in online social networks (OSNs) and study
the scaling laws of traffic load. We propose a three-layered system model to formulate data …

A spanning tree that simultaneously approximates a shortest-path tree and a minimum
spanning tree is called a shallow-light tree (shortly, SLT). More specifically, an (α, β)-SLT of …

In the relay placement problem, the input is a set of sensors and a number r⩾ 1, the
communication range of a relay. In the one-tier version of the problem, the objective is to …

The Euclidean Steiner problem is the problem of finding a set $ St $, with the shortest length,
such that $ St\cup A $ is connected, where $ A $ is a given set in a Euclidean space. The …