Contents lists available at ScienceDirect Computer Networks

Contents lists available at ScienceDirect Computer Networks

Cached

Download Links

[heim.ifi.uio.no]

by Knut-helge Vik , Pål Halvorsen , Carsten Griwodz

BibTeX

@MISC{Vik_contentslists,
    author = {Knut-helge Vik and Pål Halvorsen and Carsten Griwodz},
    title = {Contents lists available at ScienceDirect Computer Networks},
    year = {}
}

Bookmark

OpenURL

Abstract

journal homepage: www.elsevier.com/locate/comnet Evaluating Steiner-tree heuristics and diameter variations

Citations

365	Vivaldi: a decentralized network coordinate system - Dabek, Cox, et al.
276	ALMI: An Application level Multicast Infrastructure - Pendarakis, Shi, et al. - 2001
134	Steiner problem in networks: a survey - Winter - 1987
125	Dynamic Steiner tree problem - Imase, Waxman - 1991
102	BRITE: Universal Topology Generation from a User’s Perspective - Medina, Lakhina, et al. - 2001
55	Topology-aware overlay networks for group communication - Kwon, Fahmy - 2002
51	ARIES: A rearrangable inexpensive edge-based on-line Steiner algorithm - Bauer, Varma - 1997
48	Dimensioning server access bandwidth and multicast routing in overlay networks - Shi, Turner, et al. - 2001
45	Latency and player actions in online games - Claypool, Claypool
43	The Narada Event Brokering System: Overview and Extensions," presented at - Fox, Pallickara - 2002
42	Algorithm Design: Foundations, Analysis, and Internet Examples - Goodrich, Tamassia - 2002
41	Overlay mesh construction using interleaved spanning trees - Young, Jiang, et al. - 2004
31	Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem - Raidl, Julstrom - 2003
30	The effect of latency on user performance in real-time strategy games. Computer Networks 49(1 - Claypool - 2005
28	An approximate solution for the Steiner problem - Takahashi, Matsuyama - 1980
26	Steiner’s problem in graphs: heuristic methods - Voss - 1992
23	Degree-constrained minimum spanning trees - Narula, Ho - 1980
21	The fun of using TCP for an MMORPG - Griwodz, Halvorsen - 2006
17	Approximating shallow-light trees, in - Kortsarz, Peleg - 1997
16	A Fast Algorithm for Steiner Trees, Acta Inf - Kou, Markowsky, et al. - 1981
14	Approximation and Heuristic Algorithms for Minimum-Delay Application-Layer Multicast Trees - Brosh, Levin, et al. - 2007
13	Analysis of the NICE application layer multicast protocol - Banerjee, Bhattacharjee - 2002
12	An analysis of MMOG subscription growth - Woodcock - 2006
9	Core-selection algorithms in multicast routing – comparative and complexity analysis - Karaman, Hassanein
8	Random-tree diameter and diameter-constrained - Abdalla, Deo, et al. - 2000
8	Applicability of group communication for increased scalability in MMOGs - Vik, Griwodz, et al. - 2006
6	Multicast tree diameter for dynamic distributed interactive applications - Vik, Halvorsen, et al.
5	The computation of nearly minimal Steiner trees - Rayward-Smith, Clare - 1983
5	Minimum restricted diameter spanning trees - Hassin, Levin - 2002
5	Bounded diameter minimum spanning trees and related problems - Ho, Lee - 1989
5	Dynamic group membership management for distributed interactive applications - Vik, Griwodz, et al. - 1997
4	Delay bounded minimum Steiner tree algorithms for performancedriven routing - Zhu, Dai - 1993
4	Immersive peer-to-peer audio streaming platform for massive online games - Liu, Zimmermann - 2006
3	On steiner centers and steiner medians of graphs - Oellermann - 1999
3	Constrained diameter Steiner trees for multicast conferences in overlay networks, in - Aggarwal, Limaye, et al. - 2004
1	Spanning Trees and Opitmization Problems, Chapman and Hall/CRC - Wu, Chao - 2004