Maximum flow problem in wireless ad hoc networks with directional antennas
- 8 August 2006
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 1 (1) , 71-84
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Does topology control reduce interference?2004
- Impact of interference on multi-hop wireless network performance2003
- Characterizing achievable rates in multi-hop wireless networks2003
- A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems*Journal of Global Optimization, 2000
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Strongly polynomial dual simplex methods for the maximum flow problemMathematical Programming, 1998
- A self-stabilizing algorithm for the maximum flow problemDistributed Computing, 1997
- Use of dynamic trees in a network simplex algorithm for the maximum flow problemMathematical Programming, 1991
- A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) timeMathematical Programming, 1990
- On the efficiency of maximum-flow algorithms on networks with small integer capacitiesAlgorithmica, 1989