Abstract
Generalized maximum flow problem is a generalization of the traditional maximum flow problem, where each edge e has gain factor γ(e). When f(e) units of flow enter edge e = (u, v) at u, then γ(e) f(e) units of flow arrive at v. Since relation extraction, which is an important application of the problem, uses large networks such as Wikipedia and DBLP, the computation time to solve the problem is important. However, conventional algorithms for the problem are expensive and do not scale to large graph. Therefore, we propose approximation algorithms based on greedy augmentation and a heuristic initial flow calculation. The experimental result shows that our algorithms are two orders of magnitude faster than a conventional algorithm.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Zhang, X., Asano, Y., Yoshikawa, M.: A generalized flow based method for analysis of implicit relationships on wikipedia. IEEE Transactions on Knowledge and Data Engineering (November 10, 2011)
Yazdani, M., Popescu-Belis, A.: A random walk framework to compute textual semantic similarity: A unified model for three benchmark tasks. In: ICSC, pp. 424–429 (2010)
Sarkar, P., Moore, A.W.: A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In: UAI, pp. 335–343 (2007)
White, H.D., Griffith, B.C.: Author cocitation: A literature measure of intellectual structure. Journal of the American Society for Information Science 32(3), 163–171 (1981)
Ito, M., Nakayama, K., Hara, T., Nishio, S.: Association thesaurus construction methods based on link co-occurrence analysis for wikipedia. In: CIKM, pp. 817–826 (2008)
Goldfarb, D., Jin, Z., Orlin, J.B.: Polynomial-time highest gain augmenting path algorithms for the generalized circulation problem. Mathematics of Operations Research 22, 793–802 (1997)
Fleischer, L.K., Wayne, K.D.: Fast and simple approximation schemes for generalized flow. Mathematical Programming 91(2), 215–238 (2002)
Kapoor, S., Vaidya, P.M.: Speeding up karmarkar’s algorithm for multicommodity flows. Mathematical Programming 73, 111–127 (1996)
Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication (extended abstract). In: IEEE Symposium on Foundations of Computer Science, pp. 332–337 (1989)
Goldberg, A.V., Plotkin, S.A., Tardos, É.: Combinatorial algorithms for the generalized circulation problem. In: IEEE Symposium on Foundations of Computer Science, pp. 432–443 (1988)
Cohen, E., Megiddo, N.: New algorithms for generalized network flows. In: Dolev, D., Rodeh, M., Galil, Z. (eds.) ISTCS 1992. LNCS, vol. 601, pp. 103–114. Springer, Heidelberg (1992)
Radzik, T.: Faster algorithms for the generalized network flow problem. In: IEEE Symposium on Foundations of Computer Science, pp. 438–448 (1993)
Tardos, É., Wayne, K.D.: Simple generalized maximum flow algorithms. In: Integer Programming & Combinatorial Optimization, pp. 310–324 (1998)
Onaga, K.: Dynamic programming of optimum flows in lossy communication nets. IEEE Trans. Circuit Theory, 308–327 (1966)
Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 631–636 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nojima, Y., Asano, Y., Yoshikawa, M. (2013). Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks. In: Akiyama, J., Kano, M., Sakai, T. (eds) Computational Geometry and Graphs. TJJCCGG 2012. Lecture Notes in Computer Science, vol 8296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45281-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-45281-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45280-2
Online ISBN: 978-3-642-45281-9
eBook Packages: Computer ScienceComputer Science (R0)