APPROXIMATION ALGORITHMS FOR MINIMUM-TIME BROADCAST

被引：0

作者：

KORTSARZ, G

PELEG, D

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 601卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper deals with the problem of broadcasting in minimum time. Approximation algorithms are developed for arbitrary graphs, as well as for several restricted graph classes.

引用

页码：67 / 78

页数：12

共 50 条

[1] APPROXIMATION ALGORITHMS FOR MINIMUM-TIME BROADCAST
KORTSARZ, G
PELEG, D
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (03) : 401 - 427
[2] Polynomial-time algorithms for minimum-time broadcast in trees
Cohen, J
Fraigniaud, P
Mitjana, M
[J]. THEORY OF COMPUTING SYSTEMS, 2002, 35 (06) : 641 - 665
[3] Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees
[J]. Theory of Computing Systems, 2002, 35 : 641 - 665
[4] Minimum-time multidrop broadcast
Farley, AM
Pelc, A
Proskurowski, A
[J]. DISCRETE APPLIED MATHEMATICS, 1998, 83 (1-3) : 61 - 77
[5] MINIMUM-TIME LINE BROADCAST NETWORKS
FARLEY, AM
[J]. NETWORKS, 1980, 10 (01) : 59 - 70
[6] A Class of Minimum-Time Minimum-State-Change Generalized FSSP Algorithms
Umeo, Hiroshi
Imai, Keisuke
[J]. CELLULAR AUTOMATA, ACRI 2016, 2016, 9863 : 144 - 154
[7] Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
Shang, Weiping
Wan, Pengjun
Hu, Xiaodong
[J]. FRONTIERS OF MATHEMATICS IN CHINA, 2010, 5 (01) : 75 - 87
[8] Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
Weiping Shang
Pengjun Wan
Xiaodong Hu
[J]. Frontiers of Mathematics in China, 2010, 5 : 75 - 87
[9] Minimum-time control of the acrobot
Boone, G
[J]. 1997 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION - PROCEEDINGS, VOLS 1-4, 1997, : 3281 - 3287
[10] MINIMUM-TIME BATCH PROCESSING
SCHROCK, LJ
[J]. ISA JOURNAL, 1965, 12 (10): : 75 - &

← 1 2 3 4 5 →