Results 1  10
of
1,448
Multicast Routing in Datagram Internetworks and Extended LANs
 ACM Transactions on Computer Systems
, 1990
"... Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store ..."
Abstract

Cited by 1074 (5 self)
 Add to MetaCart
describe modifications to the singlespanningtree routing algorithm commonly used by linklayer bridges, to reduce the costs of multicasting in large extended LANs. Finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up
Preferred Direction Steiner Trees
"... Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are frequently abstracted as a single rectilinear plane, ignoring via costs, layer dependent routing costs, and congestion impact for routing in a particular direction. In this ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
. In this paper, we consider preferred direction multilayer routing, which more closely models practical applications. We adapt a well known rectilinear planar Steiner tree heuristic, resulting in a new method to construct low cost Steiner trees under a realistic model. Our implementation is fast and effective
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
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 397 (2 self)
 Add to MetaCart
to Christofides) achieves a 3/2approximation in polynomial time. We also give similar approximation schemes for some other NPhard Euclidean problems: Minimum Steiner Tree, kTSP, and kMST. (The running times of the algorithm for kTSP and kMST involve an additional multiplicative factor k.) The previous best
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
, 1994
"... We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with linkcosts and, for each pair fi; jg of nodes, an edgeconnectivity requirement r ij . The goal is to find a minimumcost network using the a ..."
Abstract

Cited by 249 (38 self)
 Add to MetaCart
We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with linkcosts and, for each pair fi; jg of nodes, an edgeconnectivity requirement r ij . The goal is to find a minimumcost network using
An Efficient GraphBased Steiner Tree Heuristic for the Global Routing of Macro Cells
, 2006
"... Global routing of macro cells remains an important, but timeconsuming step, in the VLSI design cycle. Macro cells are large, irregularly sized parameterized circuit modules that typically contain large numbers of terminals that must be interconnected. The interconnection pattern for each set of ter ..."
Abstract
 Add to MetaCart
of terminals (net) that must be connected is a Steiner tree, and the primary subproblem in global routing of macro cells is to find a set of dissimilar, lowcost Steiner trees for each net that must be routed. In this paper, a twophase algorithm is proposed for quickly constructing a diverse pool of Steiner
Building Steiner trees with incomplete global knowledge
 In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science
, 2000
"... A networking problem of present day interest is that of distributing a single data item to multiple clients while minimizing network usage. Steiner tree algorithms are a natural solution method, but only when the set of clients requesting the data is known. We study what can be done without this glo ..."
Abstract

Cited by 85 (0 self)
 Add to MetaCart
A networking problem of present day interest is that of distributing a single data item to multiple clients while minimizing network usage. Steiner tree algorithms are a natural solution method, but only when the set of clients requesting the data is known. We study what can be done without
Universal Steiner Trees for Data Aggregation in Low Doubling Metrics
, 2010
"... We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node which we call as Universal Steiner Tree (UST). The tree is universal in the sense that it is static and independent of the number of data sources and fusioncosts at intermediate nodes. Th ..."
Abstract
 Add to MetaCart
. The tree construction is in polynomial time, and for low doubling dimension topologies it guarantees a 푂(log4 푛)approximation of the optimal aggregation cost. With constant fusioncost functions our aggregation tree gives a 푂(log3 푛)approximation for every Steiner tree to the sink.
Steiner tree problems with profits
 INFOR: Information Systems and Operational Research
, 2006
"... Abstract This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associated with vertices. The relationships between these costs and revenues are taken into consideration when dec ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract This is a survey of the Steiner tree problem with profits, a variation of the classical Steiner problem where, besides the costs associated with edges, there are also revenues associated with vertices. The relationships between these costs and revenues are taken into consideration when
A new class of iterative Steiner tree heuristics with good performance
 IEEE TRANS. COMPUTERAIDED DESIGN
, 1992
"... ... problem is very important for such aspects of physical layout as global routing and wiring estimation. Virtually all previous heuristics for computing rectilinear Steiner trees begin with a minimum spanning tree (MST) topology and rearrange edges to induce Steiner points. This paper gives a more ..."
Abstract

Cited by 95 (31 self)
 Add to MetaCart
... problem is very important for such aspects of physical layout as global routing and wiring estimation. Virtually all previous heuristics for computing rectilinear Steiner trees begin with a minimum spanning tree (MST) topology and rearrange edges to induce Steiner points. This paper gives a
Results 1  10
of
1,448