Results 1  10
of
686,094
Approximation Algorithms for Minimum Time Broadcast
 SIAM J. Discrete Math
, 1995
"... This paper deals with the problem of broadcasting in minimum time in the telephone and messagepassing models. Approximation algorithms are developed for arbitrary graphs, as well as for several restricted graph classes. In particular, an O( p n)additive approximation algorithm is given for br ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
This paper deals with the problem of broadcasting in minimum time in the telephone and messagepassing models. Approximation algorithms are developed for arbitrary graphs, as well as for several restricted graph classes. In particular, an O( p n)additive approximation algorithm is given
D.: Approximation algorithms for minimumtime broadcast
 SIAM J. Discrete Math
, 1995
"... Abstract. This paper deals with the problem of broadcasting in minimum time in the telephone and messagepassing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an O(vfvT)additive approximation algorithm is given f ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. This paper deals with the problem of broadcasting in minimum time in the telephone and messagepassing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an O(vfvT)additive approximation algorithm is given
Approximation algorithms for minimumtime broadcast under the vertexdisjoint paths mode
 In 9th Annual European Symposium on Algorithms (ESA '01), volume 2161 of LNCS
, 2001
"... We give a polynomialtime O( log n log OPT)approximation algorithm for minimumtime broadcast and minimumtime multicast in nnode networks under the singleport vertexdisjoint paths mode. This improves a previous approximation algorithm by Kortsarz and Peleg. In contrast, we give an (log n) lower ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We give a polynomialtime O( log n log OPT)approximation algorithm for minimumtime broadcast and minimumtime multicast in nnode networks under the singleport vertexdisjoint paths mode. This improves a previous approximation algorithm by Kortsarz and Peleg. In contrast, we give an (log n
Polynomial Time Algorithms for MinimumTime Broadcast in Trees
 Theory of Computing Systems
"... This paper addresses the minimumtime broadcast problem under several modes of the line model, i.e., when longdistance calls can be placed along paths in the network. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper addresses the minimumtime broadcast problem under several modes of the line model, i.e., when longdistance calls can be placed along paths in the network.
Approximate Signal Processing
, 1997
"... It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing these tra ..."
Abstract

Cited by 516 (2 self)
 Add to MetaCart
number of ideas and approaches to approximate processing as currently being formulated in the computer science community. We then present four examples of signal processing algorithms/systems that are structured with these goals in mind. These examples may be viewed as partial inroads toward the ultimate
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
The space complexity of approximating the frequency moments
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1996
"... The frequency moments of a sequence containing mi elements of type i, for 1 ≤ i ≤ n, are the numbers Fk = �n i=1 mki. We consider the space complexity of randomized algorithms that approximate the numbers Fk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly, ..."
Abstract

Cited by 855 (12 self)
 Add to MetaCart
The frequency moments of a sequence containing mi elements of type i, for 1 ≤ i ≤ n, are the numbers Fk = �n i=1 mki. We consider the space complexity of randomized algorithms that approximate the numbers Fk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly
On the Construction of EnergyEfficient Broadcast and Multicast Trees in Wireless Networks
, 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract

Cited by 554 (13 self)
 Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil
The broadcast storm problem in a mobile ad hoc network
 ACM Wireless Networks
, 2002
"... Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm s ..."
Abstract

Cited by 1217 (15 self)
 Add to MetaCart
Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Results 1  10
of
686,094