Pierre Fraigniaud  Home/Search
Context Related
| lri.fr/~pierre/POSTSCRIPTS/fun01.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lri.fr/~pierre/...biblio_par_date (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper aims to study broadcast and multicast communication problems in networks under several variants of the edge-disjoint path mode. We derive upper and lower bounds for the approximability ratios of these problems (i.e., the worst-case ratios of the time required for a protocol computed in polynomial time to complete, over the time of an optimal protocol). These bounds show that slight modifications of the model (graphs vs. digraphs, all-port vs. single port, standard regimen vs.... (Update)
Similar documents based on text:
0.2: Approximation Algorithms for Minimum-Time Broadcast under the.. - Fraigniaud (2001) (Correct)
0.1: Parameterized Tractability of Edge-Disjoint Paths on Directed.. - Slivkins (2003) (Correct)
BibTeX entry: (Update)
P. Fraigniaud, "Minimum-time broadcast under edge-disjoint paths modes," International conference on fun with algorithm, 2001. http://citeseer.ist.psu.edu/fraigniaud01minimumtime.html More
@misc{ fraigniaud01minimumtime,
author = "P. Fraigniaud",
title = "Minimum-time broadcast under edge-disjoint paths modes",
text = "P. Fraigniaud, Minimum-time broadcast under edge-disjoint paths modes,
International conference on fun with algorithm, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/fraigniaud01minimumtime.html" }
Citations (may not include all citations):184 A survey of gossiping and broadcasting in communication netw.. (context) - Hedetniemi, Hedetniemi et al. - 1986
118 Methods and Problems of Communication in Usual Networks (context) - Fraigniaud, Lazard - 1994
82 Dissemination of information in interconnection networks - Hromkovic, Klasing et al. - 1995
71 A data structure for manipulating priority queues (context) - Vuillemin - 1978
52 Multipoint communication: a survey of protocols (context) - Diot, Dabbous et al. - 1997
41 New models and algorithms for future networks - Cidon, Gopal et al. - 1995
30 A threshold of lnn for approximating set cover - Feige - 1998
30 Minimum-time line broadcast networks (context) - Farley - 1980
28 Circuit-switched broadcasting in torus networks (context) - Peters, Syska - 1996
26 Approximation algorithms for minimum time broadcast - Kortsarz, Peleg - 1995
25 Rapid rumor ramification: approximating the minimum broadcas.. (context) - Ravi - 1994
16 Approximating the minimum-degree steiner tree to within one .. (context) - Furer, Raghavachari - 1994
8 Multicasting in heterogeneous networks (context) - Bar-Noy, Guha et al. - 1998
7 Toward a general theory of unicast-based multicast communica.. - Birchler, Esfahanian et al. - 1995
6 multicasting and gossiping in trees under the allport line m.. (context) - Cohen - 1998
[Article contains additional citations not shown here]
Documents on the same site (http://www.lri.fr/~pierre/ma_biblio_par_date.html): More
A General Theory for Deadlock Avoidance in Wormhole-Routed.. - Fraigniaud (1998) (Correct)
Strategies for Path-Based Multicasting in Wormhole-Routed.. - Fleury, Fraigniaud (1997) (Correct)
Hierarchical Broadcast Networks - Fraigniaud (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