Results 1  10
of
221
Balancing Minimum Spanning Trees and ShortestPath Trees
, 2002
"... We give a simple algorithm to find a spanning tree that simultaneously approximates a shortestpath tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and a fl? 0, the algorithm returns a spanning tree in which the distance between any vertex and the ..."
Abstract

Cited by 54 (1 self)
 Add to MetaCart
We give a simple algorithm to find a spanning tree that simultaneously approximates a shortestpath tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and a fl? 0, the algorithm returns a spanning tree in which the distance between any vertex
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 414 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
Approximate Bounds and Expressions for the Link Utilization of ShortestPath Multicast Network Traffic
"... Multicast network traffic is information with one source node, but many destination nodes. Rather than setting up individual connections between the source node and each destination node, or broadcasting the information to the entire network, multicasting efficiently exploits link capacity by allowi ..."
Abstract
 Add to MetaCart
(cache coherency, multiprocessor message passing). In this paper, we derive approximate expressions for the minimum cost (in terms of link utilization) of shortestpath multicast traffic in arbitrary tree networks. Our results provide a theoretical bestcase scenario for link utilization of multicast
Approximating geometric bottleneck shortest paths
 Computational Geometry: Theory and Applications
"... In a geometric bottleneck shortest path problem, we are given a set S of n points in the plane, and want to answer queries of the following type: Given two points p and q of S and a real number L, compute (or approximate) a shortest path between p and q in the subgraph of the complete graph on S con ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
In a geometric bottleneck shortest path problem, we are given a set S of n points in the plane, and want to answer queries of the following type: Given two points p and q of S and a real number L, compute (or approximate) a shortest path between p and q in the subgraph of the complete graph
Energyefficient broadcasting in adhoc networks: combining msts with shortestpath trees
 of the European Project CRESCCO at www.ceid.upatras.gr/crescco
, 2003
"... We investigate the problem of constructing a multicast tree in adhoc networks. In particular, we address the issue of the power consumption, that is, the overall energy that the stations must spend to implement such a tree. We focus on two extreme cases of multicast: broadcast (onetoall) and unic ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
. In this work, we experimentally evaluate the performances of an algorithm combining MST solutions with SPT ones. Our approach is based on the construction of Light Approximate Shortestpath Trees (LASTs) of a given directed weighted graph, introduced by Khuller et al [1995]. LASTs approximate simultaneously
ShortestPath Queries for Complex Networks: Exploiting Low Treewidth Outside the Core
"... We present new and improved methods for efficient shortestpath query processing. Our methods are tailored to work for two specific classes of graphs: graphs with small treewidth and complex networks. Seemingly unrelated at first glance, these two classes of graphs have some commonalities: complex ne ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
new tradeoffs between space and query time. Second, we present an improved treedecompositionbased method for complex networks, utilizing the methods for graphs with small treewidth. Third, we extend our method to handle the highly interconnected core with existing exact and approximate methods. We
Atlas: Approximating Shortest Paths in Social Graphs
"... Abstract. The search for shortest paths is an essential primitive for a variety of graphbased applications, particularly those on online social networks. For example, LinkedIn users perform queries to find the shortest path “social links” connecting them to a particular user to facilitate introduct ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
introductions. This type of graph query is challenging for moderately sized graphs, but becomes computationally intractable for graphs underlying today’s social networks, most of which contain millions of nodes and billions of edges. We propose Atlas, a novel approach to scalably approximate shortest paths
Fuzzy Shortest Path For Steiner Tree Problem
 INTERNATIONAL JOURNAL ON COMPUTER SCIENCE AND ENGINEERING (IJCSE)
"... In this paper, a modification of the shortest path approximation based on the fuzzy shortest paths evaluations. The Steiner tree problem on a graph in which a fuzzy number instead of a real number is assigned to each edge. Here, to solve the fuzzy shortest path using a new approach ranking method. ..."
Abstract
 Add to MetaCart
In this paper, a modification of the shortest path approximation based on the fuzzy shortest paths evaluations. The Steiner tree problem on a graph in which a fuzzy number instead of a real number is assigned to each edge. Here, to solve the fuzzy shortest path using a new approach ranking method.
Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs
, 2006
"... In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since a fuzzy min operation using the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since a fuzzy min operation using
Results 1  10
of
221