Maximum flow problem in wireless ad hoc networks with directional antennas
From MaRDI portal
Publication:2458905
DOI10.1007/S11590-006-0016-3zbMATH Open1122.90012OpenAlexW1990671495MaRDI QIDQ2458905FDOQ2458905
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
Cites Work
- Title not available (Why is that?)
- The capacity of wireless networks
- On the complexity of preflow-push algorithms for maximum-flow problems
- Strongly polynomial dual simplex methods for the maximum flow problem
- 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
- Title not available (Why is that?)
- An incremental algorithm for the maximum flow problem
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Title not available (Why is that?)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
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 👍 👎
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)
