Abstract
In this paper, we present (1) our implementation of a fast approximation multicommodity flow algorithm, and (2) our implementation of the first provably good approximation algorithm for the minimum normalized cut problem. (2) serves as an important application of (1). Our experimental results show that the output quality of our approach compares favorably against some previous approximation multicommodity flow implementation and eigenvalue/eigenvector based normalized cut implementation. We also show comparisons on the execution times and analyze the underlying reasons.
This research was supported in part by the 21st Century Research and Technology Fund from the State of Indiana.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Ben-Dor, A., Yakhini, Z.: Clustering Gene Expression Patterns. In: Proc. of 3rd ACM RECOMB, pp. 33–42 (1999)
Bienstock, D.: talk at Oberwolfach, Germany (1999)
Carballido-Gamio, J., Belongie, S.J., Majumdar, S.: Normalized Cuts in 3-D for Spinal MRI Segmentation. IEEE Transactions on Medical Imaging (2003) (to appear)
Chen, J., Bai, Z., Hamann, B., Ligocki, T.J.: A Normalized-Cut Algorithm for Hierarchical Vector Field Data Segmentation. In: Proc. of Visualization and Data Analysis, Santa Clara, CA (2003)
Chen, D.Z., Wu, X.: Data Clustering Based Segmentation Algorithms of Bone CT Images. In: Proc. of 9th Annual Symp. of Computational Methods in Orthopaedic Biomechanics, San Francisco, p. 19 (2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)
Even, G., Naor, J., Rao, S., Schieber, B.: Fast Approximate Graph Partitioning Algorithms. SIAM J. Computing 28, 2187–2214 (1999)
Fleischer, L.: Approximation Fractional Multicommodity Flow Independent of the Number of Commodities. SIAM J. Discrete Math. 13(2), 145–153 (2000)
Garg, N., Könemann, J.: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. In: Proc. of 39th IEEE Foundation of Computer Science, pp. 300–309 (1998)
Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. SIAM J. Computing 25, 235–251 (1996)
Grigoriadis, M.D., Khachiyan, L.G.: Approximate Minimum-Cost Multicommodity Flows. Mathematical Programming 75, 477–482 (1996)
Guattery, S., Miller, G.: On the Performance of Spectral Graph Partitioning Methods. In: Proc. of 6th ACM-SIAM SODA, pp. 233–242 (1995)
Hofmann, T., Buhmann, J.: Pairwise Data Clustering by Deterministic Annealing. IEEE Trans. on Pattern Analysis and Machine Intelligence 19, 1–14 (1997)
Karakostas, G.: Faster Approximation Schemes for Fractional Multicommodity Flow Problems. In: Proc. of 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 166–173 (2002)
Karger, D., Plotkin, S.: Adding Multiple Cost Constraints to Combinatorial Optimization Problems, with Applications to Multicommodity Flows. In: Proc. of 27th ACM STOC, pp. 18–25 (1995)
Klein, P., Plotkin, S., Stein, C., Tardos, É.: Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM J. Computing 23, 466–487 (1994)
Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, É., Tragoudas, S.: Fast Approximation Algorithms for Multicommodity Flow Problems. J. of Computer and System Sciences 50, 228–243 (1995)
Leighton, T., Rao, S.: Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms. J. of the ACM 46, 787–832 (1999)
Leong, T., Shor, P., Stein, C.: Implementation of a Combinatorial Multicommodity Flow Algorithm. DIMACS Series in Discrete Mathematics and Theoretical Computer Science: The 1st DIMACS Implementation Challenge: Network Flows and Matchings, D. Johnson and C. McGoech, eds. (1993)
Plotkin, S., Shmoys, D., Tardos, É.: Fast Approximation Algorithms for Fractional Packing and Covering Problems. Mathematics of Operations Research 20, 257–301 (1995)
Radzik, T.: Fast Deterministic Approximation for the Multicommodity Flow Problem. In: Proc. of 6th ACM-SIAM SODA, pp. 486-492 (1995)
Shenoy, G.V.: Linear Programming Methods and Applications. Wiley Eastern Limited, Chichester (1989)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Wu, X., Chen, D.Z., Mason, J.J., Schmid, S.R.: Pairwise Data Clustering and Applications. In: Proc. of 9th Annual International Computing and Combinatorics Conference, pp. 455-466 (2003)
Young, N.: Randomized Routing without Solving the Linear Program. In: Proc. of 6th ACM-SIAM SODA, pp. 170-178 (1995)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Du, Y., Chen, D.Z., Wu, X. (2004). Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive