Results 1 
8 of
8
Facility Location and the Geometric MinimumDiameter Spanning Tree
, 2003
"... Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1, respecti ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1
Approximating the Geometric MinimumDiameter Spanning Tree
 Institut für Mathematik und Informatik, Universität Greifswald
, 2002
"... Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST whose longest path consists of two or three edges, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST whose longest path consists of two or three edges
On Shortest Networks for Classes of Points in the Plane
, 1991
"... We are given a set P of points in the plane, together with a partition of P into classes of points; i.e., each point of P belongs to exactly one class. For a given network optimization problem, such as finding a minimum spanning tree or finding a minimum diameter spanning tree, we study the problem ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We are given a set P of points in the plane, together with a partition of P into classes of points; i.e., each point of P belongs to exactly one class. For a given network optimization problem, such as finding a minimum spanning tree or finding a minimum diameter spanning tree, we study the problem of choosing a subset P 0 of P that contains at least one point of each class and solving the network optimization problem for P 0 , such that the solution is optimal among all possible choices for P 0 . We show that solving the minimum spanning tree problem for classes of points in the plane is NPcomplete, where the distance between points is defined by any of the Minkowski metrics L p ; 1 p 1. In contrast, a class solution for the minimum diameter spanning tree problem can be computed in time O(jP j 3 ). By proving the NPcompleteness of the minimum spanning tree class problem we also get some results for distance graphs. Here, computing a class solution for the minimum spannin...
unknown title
"... ag ne ti sm ro ck m ag ne ti sm an d pa la eo m ag ne ti sm The bedrock electrical conductivity structure of Northern Ireland ..."
Abstract
 Add to MetaCart
ag ne ti sm ro ck m ag ne ti sm an d pa la eo m ag ne ti sm The bedrock electrical conductivity structure of Northern Ireland
Group Communication Techniques in Overlay Networks (submitted
, 2008
"... One type of Internet services that have recently gained much attention are services that enable people around the world to communicate in realtime. Such services of realtime interaction are offered by applications most commonly referred to as distributed interactive applications. Concrete examples ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
One type of Internet services that have recently gained much attention are services that enable people around the world to communicate in realtime. Such services of realtime interaction are offered by applications most commonly referred to as distributed interactive applications. Concrete examples of distributed interactive applications are multiplayer online games, audio/video conferencing, and many virtualreality applications linked to education, entertainment, military, etc. A timedependent requirement generally applies to all distributed interactive applications that aim to support realtime interaction, and is usually in terms of a few hundred milliseconds. The latency requirements are manifested in terms of eventdistribution, group membership management, group dynamics, etc., far exceeding the requirements of many other applications. One general focal point in this thesis is to enable scalable group communication for managing dynamic groups of clients that interact in realtime. By doing this, we want to enable people around the world to dynamically join networks of participants and interact with them in realtime. The main contributions of the thesis are a number of investigations of a wide variety of group communication techniques. The results from the investigations form a foundation to identify the techniques that are particularly suitable for distributed interactive applications.
To wn STRUCTURAL AND SPECTROSCOPIC STUDIES WITH DITHIZONE AND ITS DERIVATIVES
, 1980
"... ive rsi ty of ..."