Maximum flow problem in wireless ad hoc networks with directional antennas

DOI10.1007/S11590-006-0016-3MaRDI QIDQ2458905zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 5 November 2007

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-006-0016-3

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Improved algorithms in directional wireless sensor networks
• Distributed Computing - IWDC 2003
• A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks
• Exact and performance-guaranteed multicast algorithms for lifetime optimization in WANETs
• Optimization in wireless networks

Cites work

• scientific article; zbMATH DE number 1187161 (Why is no real title available?)
• scientific article; zbMATH DE number 2043489 (Why is no real title available?)
• A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
• A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
• An incremental algorithm for the maximum flow problem
• Network flows. Theory, algorithms, and applications.
• On the complexity of preflow-push algorithms for maximum-flow problems
• On the efficiency of maximum-flow algorithms on networks with small integer capacities
• Strongly polynomial dual simplex methods for the maximum flow problem
• The capacity of wireless networks
• Use of dynamic trees in a network simplex algorithm for the maximum flow problem

This page was built for publication: Maximum flow problem in wireless ad hoc networks with directional antennas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458905)