See this document in CiteSeerX!

Trade-offs on the Location of the Core Node in a Network (2004)  (Make Corrections)  
Jean-Francois Macq, Michel X. Goemans



  Home/Search   Context   Related

 
View or download:
mit.edu/~goemans/n...tworksreprint.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  mit.edu/~goemans/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this article we focus on a particular case, called All Receivers Sources in [3], where the set of senders is (or can be approximated as) the set of receivers. As mentioned above, this case is relevant for several multimedia applications (Update)

Active bibliography (related documents):   More   All
0.1:   A Scalable Approach for Core Failure Recovery in Multicasting - Manimaran, Chakrabarti (1911)   (Correct)
0.1:   A Case for Tree Migration and Integrated Tree Maintenance .. - Chakrabarti, Manimaran   (Correct)
0.1:   Core Selection with End-to-End QoS Support - Putthividhya, Tavanapong, Tran, .. (2004)   (Correct)

Similar documents based on text:   More   All
0.3:   Choquet Rationality - Ghirardato, Le Breton (1999)   (Correct)
0.2:   On The Complexity Of Coordination - Gossner, Hernández (2001)   (Correct)
0.2:   Productivity Growth in Industrialized Countries - Simar, Wilson (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ macq-tradeoffs,
  author = "Jean-Francois Macq and Michel X. Goemans",
  title = "Trade-offs on the Location of the Core Node in a Network",
  url = "citeseer.ist.psu.edu/macq04tradeoffs.html" }
Citations (may not include all citations):
146   Steiner problem in networks: A survey (context) - Winter - 1987
134   A distributed algorithm for minimum-weight spanning trees (context) - Gallager, Humblet et al. - 1983
94   Core-based trees (CBT): An architecture for scalable inter-d.. (context) - Ballardie, Francis et al. - 1993
49   Improved Steiner tree approximation in graphs - Robins, Zelikovsky
47   Bicriteria network design problems - Marathe, Ravi et al. - 1998
45   Cost-sensitive analysis of communication protocols (context) - Awerbuch, Baratz et al. - 1990
31   Core selection methods for multicast routing - Calvert, Zegura et al. - 1995
25   the performance and feasibility of multicast core selection .. - Fleury, Huang et al. - 2000
25   Distributed center-location algorithms - Thaler, Ravishankar - 1997
21   Balancing minimum spanning trees and shortest-path trees - Khuller, Raghavachari et al. - 1995
20   A dual ascent approach for Steiner tree problems on a direct.. (context) - Wong - 1984
19   the existence of schedules that are near-optimal for both ma.. - Stein, Wein - 1997
1   Bicriteria compact location problems - Krumke, Noltemeier et al. - 1996
1   A rendez-vous point selection algorithm for videoconferencin.. (context) - Macq, Wolsey et al.
1   Connection optimization for two types of videoconferences (context) - Leung, Yum - 1996

Documents on the same site (http://www-math.mit.edu/~goemans/):   More
Semidefinite Programs and Association Schemes - Goemans, Rendl (1999)   (Correct)
Semidefinite Programming and Combinatorial Optimization - Goemans   (Correct)
Approximate Edge Splitting - Goemans (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC