Abstract
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent research in wireless networking has shown that it is possible to design networks where the capacity of the links can be changed adaptively to suit the needs of specific applications. In particular, one gets a choice of having few high capacity outgoing links or many low capacity ones at any node of the network. This motivates us to have a re-look at the traditional combinatorial optimization problems and design algorithms to solve them in this new framework. In particular, we consider the problem of maximum bipartite flow, which has been studied extensively in the traditional network model. One of the motivations for studying this problem arises from the need to maximize the throughput of an infrastructure wireless network comprising base-stations (one set of vertices in the bipartition) and clients (the other set of vertices in the bipartition). We show that this problem has a significantly different combinatorial structure in this new network model from the classical one. While there are several polynomial time algorithms solving the maximum bipartite flow problem in traditional networks, we show that the problem is NP-hard in the new model. In fact, our proof extends to showing that the problem is APX-hard. We complement our lower bound by giving two algorithms for solving the problem approximately. The first algorithm is deterministic and achieves an approximation factor of O(logN), where there are N nodes in the network, while the second algorithm (which is our main contribution) is randomized and achieves an approximation factor of \(\frac{e}{e-1}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andelman, N., Mansour, Y.: Auctions with budget constraints. In: 9th Scandinavian Workshop on Algorithm Theory, pp. 26–38 (2004)
Azar, Y., Regev, O.: Combinatorial algorithms for the unsplittable flow problem. Algorithmica 44(1), 49–66 (2006)
Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. Algorithmica 47(1), 53–78 (2007)
Chandra, R., Mahajan, R., Moscibroda, T., Raghavendra, R., Bahl, P.: A case for adapting channel width in wireless networks. In: SIGCOMM, pp. 135–146 (2008)
Chekuri, C., Khanna, S., Shepherd, F.B.: An O(sqrt(n)) approximation and integrality gap for disjoint paths and unsplittable flow. Theory of Computing 2(1), 137–146 (2006)
Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Doklady (Doklady) 11, 1277–1280 (1970)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19(2), 248–264 (1972)
Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput. 4(4), 507–518 (1975)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783–797 (1998)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921–940 (1988)
Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, F.B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67(3), 473–496 (2003)
Hopcroft, J.E., Karp, R.M.: An n\(^{\mbox{5/2}}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)
Karger, D.R.: Using random sampling to find maximum flows in uncapacitated undirected graphs. In: STOC, pp. 240–249 (1997)
Karger, D.R.: Better random sampling algorithms for flows in undirected graphs. In: SODA, pp. 490–499 (1998)
Karger, D.R., Levine, M.S.: Finding maximum flows in undirected graphs seems easier than bipartite matching. In: STOC, pp. 69–78 (1998)
Karger, D.R., Levine, M.S.: Random sampling in residual graphs. In: STOC, pp. 63–66 (2002)
Kleinberg, J.M.: Single-source unsplittable flow. In: FOCS, pp. 68–77 (1996)
Moscibroda, T., Chandra, R., Wu, Y., Sengupta, S., Bahl, P., Yuan, Y.: Load-Aware Spectrum Distribution in Wireless LANs. In: ICNP (2008)
Shannon, C.E.: Communication in the presence of noise. Proc. Institute of Radio Engineers 37(1), 10–21 (1949)
Srinivasan, A.: Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: FOCS, pp. 416–425 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., MÄ…dry, A., Moscibroda, T., Panigrahi, D., Srinivasan, A. (2009). Maximum Bipartite Flow in Networks with Adaptive Channel Width. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-02930-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02929-5
Online ISBN: 978-3-642-02930-1
eBook Packages: Computer ScienceComputer Science (R0)