ECUMN
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. MPNT (Multicast Proxies NeTwork) is an overlay architecture that was first conceived to provide multicast access to unicast-only users, like TutTelNet distant students. ...
GECCO
2005
Springer
14 years 5 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
ICCNMC
2005
Springer
14 years 5 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
FCT
2005
Springer
14 years 5 months ago
2005
Springer
: In this paper, we investigate the problem to find an acyclic subhypergraph in a given hypergraph, which is an extension to find a tree in a graph. First, we introduce a spannin...
EUROPAR
2005
Springer
14 years 5 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
DSOM
2005
Springer
14 years 5 months ago
2005
Springer
Threshold crossing alerts (TCAs) indicate to a management system that a management variable, associated with the state, performance or health of the network, has crossed a certain ...
AFRIGRAPH
2006
ACM
14 years 5 months ago
2006
ACM
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
BROADNETS
2006
IEEE
14 years 5 months ago
2006
IEEE
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...