Article
A Simulation-based Performance Analysis of Multicast Routing in Mobile Ad hoc Networks.
IJIPM
01/2010;
1:4-14.
pp.4-14
Source: DBLP
- Citations (15)
-
Cited In (0)
-
Article: MERIT: A Scalable Approach for Protocol Assessment.
MONET. 01/2003; 8:567-577. -
Article: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications
IEEE Std 802.11-2007 (Revision of IEEE Std 802.11-1999). 01/2007; -
Article: A fast algorithm for Steiner trees
[show abstract] [hide abstract]
ABSTRACT: Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and SV is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. In this paper, we analyze a heuristic algorithm for the Steiner tree problem. The heuristic algorithm has a worst case time complexity of O(SV 2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1–1/l) times that of the optimal tree, where l is the number of leaves in the optimal tree.Acta Informatica 05/1981; 15(2):141-145. · 0.44 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed.
The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual
current impact factor.
Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence
agreement may be applicable.