Results 1  10
of
620,313
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
in the flow value then, provided the capacities are integral, a maximum flow will be determined within at most 1 + logM/(M1) if(t, S) augmentations, wheref*(t, s) is the value of the maximum flow and M is the maximum number of arcs across a cut. Next a new algorithm is given for the minimumcost flow
Scheduling Multicasts on UnitCapacity Trees and Meshes
, 1998
"... This paper studies the multicast routing and admission control problem on unitcapacity tree and mesh topologies in the throughputmodel. The problem is a generalization of the edgedisjoint paths problem and is NPhard both on trees and meshes. We study both the offline and the online version of ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper studies the multicast routing and admission control problem on unitcapacity tree and mesh topologies in the throughputmodel. The problem is a generalization of the edgedisjoint paths problem and is NPhard both on trees and meshes. We study both the offline and the online version
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
Scheduling Multicasts on UnitCapacity Trees and Meshes
, 1999
"... This paper studies the multicast routing and admission control problem on unitcapacity tree and mesh topologies in the throughputmodel. The problem is a generalization of the edgedisjoint paths problem and is NPhard both on trees and meshes. We study both the offline and the online version of th ..."
Abstract
 Add to MetaCart
This paper studies the multicast routing and admission control problem on unitcapacity tree and mesh topologies in the throughputmodel. The problem is a generalization of the edgedisjoint paths problem and is NPhard both on trees and meshes. We study both the offline and the online version
Scheduling Multicasts on UnitCapacity Trees and Meshes
, 1998
"... This paper studies the multicast routing and admission control problem on unitcapacity tree and mesh topologies in the throughputmodel. The problem is a generalization of the edgedisjoint paths problem and is NPhard both on trees and meshes. We study both the offline and the online version of the ..."
Abstract
 Add to MetaCart
This paper studies the multicast routing and admission control problem on unitcapacity tree and mesh topologies in the throughputmodel. The problem is a generalization of the edgedisjoint paths problem and is NPhard both on trees and meshes. We study both the offline and the online version
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 690 (64 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm
A Survey on Sensor Networks
, 2002
"... Recent advancement in wireless communica tions and electronics has enabled the develop ment of lowcost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues that research ..."
Abstract

Cited by 1905 (1 self)
 Add to MetaCart
Recent advancement in wireless communica tions and electronics has enabled the develop ment of lowcost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues
Wireless sensor networks: a survey
, 2002
"... This paper describes the concept of sensor networks which has been made viable by the convergence of microelectromechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of fact ..."
Abstract

Cited by 1936 (23 self)
 Add to MetaCart
This paper describes the concept of sensor networks which has been made viable by the convergence of microelectromechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 611 (2 self)
 Add to MetaCart
An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines
Results 1  10
of
620,313