Search
Now showing items 1-4 of 4
Cost allocation mechanisms in a peer‐to‐peer network
(Wiley, 2019-01)
This study analyzes a cooperative game between a service provider and a set of users. We consider a P2P network where the service provider broadcasts the content across the network and the users collaborate to seed the ...
The Steiner tree problem with delays: a compact formulation and reduction procedures
(Elsevier, 2014-02-19)
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size ...
An exact algorithm for the Steiner tree problem with delays
(Elsevier, 2010-08-01)
The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ...
A branch-and-cut algorithm for the Steiner tree problem with delays
(Springer Science+Business Media, 2012-12)
In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present ...
Share this page