Advertisement

Algorithmica

, Volume 81, Issue 1, pp 367–392 | Cite as

Structural Results on Matching Estimation with Applications to Streaming

  • Marc Bury
  • Elena Grigorescu
  • Andrew McGregor
  • Morteza Monemizadeh
  • Chris SchwiegelshohnEmail author
  • Sofya Vorotnikova
  • Samson Zhou
Article
  • 47 Downloads

Abstract

We study the problem of estimating the size of a matching when the graph is revealed in a streaming fashion. Our results are multifold:
  1. 1.

    We give a tight structural result relating the size of a maximum matching to the arboricity\(\alpha \) of a graph, which has been one of the most studied graph parameters for matching algorithms in data streams. One of the implications is an algorithm that estimates the matching size up to a factor of \((\alpha +2)(1+\varepsilon )\) using \(\tilde{O}(\alpha n^{2/3})\) space in insertion-only graph streams and \(\tilde{O}(\alpha n^{4/5})\) space in dynamic streams, where n is the number of nodes in the graph. We also show that in the vertex arrival insertion-only model, an \((\alpha +2)\) approximation can be achieved using only \(O(\log {n})\) space.

     
  2. 2.

    We further show that the weight of a maximum weighted matching can be efficiently estimated by augmenting any routine for estimating the size of an unweighted matching. Namely, given an algorithm for computing a \(\lambda \)-approximation in the unweighted case, we obtain a \(2(1+\varepsilon )\cdot \lambda \) approximation for the weighted case, while only incurring a multiplicative logarithmic factor in the space bounds. The algorithm is implementable in any streaming model, including dynamic streams.

     
  3. 3.

    We also investigate algebraic aspects of computing matchings in data streams, by proposing new algorithms and lower bounds based on analyzing the rank of the Tutte-matrix of the graph. In particular, we present an algorithm determining whether there exists a matching of size k using \(O(k^2\log n)\) space.

     
  4. 4.

    We also show a lower bound of \(\Omega (n^{1-\varepsilon })\) space for small approximation factors to the maximum matching size in insertion-only streams. This lower bound also holds for approximating the rank of a matrix.

     

Keywords

Graph streaming Matching Estimation 

References

  1. 1.
    Ai, Y., Hu, W., Li, Y, Woodruff, D.P.: New characterizations in turnstile streams with applications. In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 20:1–20, 22 (2016)Google Scholar
  2. 2.
    Andoni, A., Nguyen, H.L.: Eigenvalues of a matrix in the streaming model. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1729–1737 (2013)Google Scholar
  3. 3.
    Assadi, S., Khanna, S., Li, Y.: On estimating maximum matching size in graph streams. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16–19 January, pp. 1723–1742 (2017)Google Scholar
  4. 4.
    Assadi, S., Khanna, S., Li, Y., Yaroslavtsev, G.: Maximum matchings in dynamic graph streams and the simultaneous communication model. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10–12 January, 2016, pp. 1345–1364 (2016)Google Scholar
  5. 5.
    Bar-Yossef, Z., Jayram, T.S., Kerenidis, I.: Exponential separation of quantum and classical one-way communication complexity. SIAM J. Comput. 38(1), 366–384 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 623–632 (2002)Google Scholar
  7. 7.
    Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 253–262 (2006)Google Scholar
  8. 8.
    Bury, M., Schwiegelshohn, C.: Sublinear estimation of weighted matchings in dynamic data streams. In: Algorithms—ESA 2015–23rd Annual European Symposium, Patras, Greece, 14–16 September, 2015, Proceedings, pp. 263–274 (2015)Google Scholar
  9. 9.
    Chakrabarti, A., Kale, S.: Strong fooling sets for multi-player communication with applications to deterministic estimation of stream statistics. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9–11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 41–50 (2016)Google Scholar
  10. 10.
    Chitnis, R., Cormode, G., Esfandiari, H., Hajiaghayi, M., McGregor, A., Monemizadeh, M., Vorotnikova, S.: Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10–12 January, 2016, pp. 1326–1344 (2016)Google Scholar
  11. 11.
    Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 205–214 (2009)Google Scholar
  12. 12.
    Cormode, G., Jowhari, H., Monemizadeh, M., Muthukrishnan. S.: The sparse awakens: streaming algorithms for matching size estimation in sparse graphs. In: 25th Annual European Symposium on Algorithms, ESA 2017, 4–6 September, 2017, Vienna, Austria, pp. 29:1–29:15 (2017)Google Scholar
  13. 13.
    Crouch, M., McGregor, A., Stubbs, D.: Dynamic graphs in the sliding-window model. In: Proceedings of the 21st Annual European Symposium (ESA), pp. 337–348 (2013)Google Scholar
  14. 14.
    Crouch, M., and Stubbs, D.: Improved streaming algorithms for weighted matching, via unweighted matching. In: Proceedings of the 18th Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pp. 96–104 (2014)Google Scholar
  15. 15.
    Crouch, M., Stubbs, D.S.: Improved streaming algorithms for weighted matching, via unweighted matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, 4–6 September, 2014, Barcelona, Spain, pp. 96–104 (2014)Google Scholar
  16. 16.
    Czygrinow, A., Hanckowiak, M., Szymanska, E.: Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs. In: Proceedings of the 20th International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 668–678 (2009)Google Scholar
  17. 17.
    Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stand. 69, 125–130 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM J. Discrete Math. 25(3), 1251–1265 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Epstein, L., Levin, A., Segev, D., Weimann, O.: Improved bounds for online preemptive matching. In: Proceedings of the 30th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 389–399 (2013)Google Scholar
  20. 20.
    Esfandiari, H., Hajiaghayi, M.T, Liaghat, V., Monemizadeh, M., Onak, K.: Streaming algorithms for estimating the matching size in planar graphs and beyond. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1217–1233 (2015)Google Scholar
  21. 21.
    Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2–3), 207–216 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM J. Comput. 38(5), 1695–1708 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Ghaffari. M.: Space-optimal semi-streaming for (2+\(\epsilon \))-approximate matching. CoRR (2017), arXiv:1701.03730
  24. 24.
    Ghashami, M., Liberty, E., Phillips, J.M., Woodruff, D.P.: Frequent directions: Simple and deterministic matrix sketching. SIAM J. Comput. 45(5), 1762–1792 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Goel, A., Kapralov, M., Khanna, S.: On the communication and streaming complexity of maximum bipartite matching. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 468–485 (2012).Google Scholar
  26. 26.
    Grigorescu, E., Monemizadeh, M., Zhou, S.: Estimating weighted matchings in o(n) space.CoRR (2016), arXiv:1604.07467
  27. 27.
    Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External Memory Algorithms: DIMACS Workshop External Memory and Visualization, vol. 50, pp. 107–118. American Mathematical Society (1999)Google Scholar
  28. 28.
    Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, 6–11 June, 2010, Indianapolis, Indiana, USA, pp. 41–52 (2010)Google Scholar
  29. 29.
    Kapralov, M.: Better bounds for matchings in the streaming model. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1679–1697 (2013)Google Scholar
  30. 30.
    Kapralov, M., Khanna, S., Sudan, M.: Approximating matching size from random streams. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 734–751 (2014)Google Scholar
  31. 31.
    Konrad, C.: Maximum matching in turnstile streams. In: Algorithms - ESA 2015—23rd Annual European Symposium, Patras, Greece, 14–16 September, 2015, Proceedings, pp. 840–852 (2015)Google Scholar
  32. 32.
    Konrad, C., Magniez, F., Mathieu, C.: Maximum matching in semi-streaming with few passes. In Proceedings of the 16th Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pp. 231–242 (2012)Google Scholar
  33. 33.
    Li, Y., Nguyen, H.L., Woodruff, D.P.: On sketching matrix norms and the top singular vector. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1562–1581 (2014)Google Scholar
  34. 34.
    Li, Y., Woodruff, D.P.: On approximating functions of the singular values in a stream. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18–21 June, 2016, pp. 726–739 (2016)Google Scholar
  35. 35.
    Li ,Y., Woodruff, D.P.: Tight bounds for sketching the operator norm, schatten norms, and subspace embeddings. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, 7–9 September, 2016, Paris, France, pp. 39:1–39:11 (2016)Google Scholar
  36. 36.
    Lovász, L.: On determinants, matchings, and random algorithms. In: Proceedings of the 2nd Conference on Fundamentals of Computation Theory (FCT), pp. 565–574 (1979)Google Scholar
  37. 37.
    Manjunath, M., Mehlhorn, K., Panagiotou, K., He, S.: Approximate counting of cycles in streams. In: Algorithms—ESA 2011—19th Annual European Symposium, Saarbrücken, Germany, 5–9 September, 2011. Proceedings, pp. 677–688 (2011)Google Scholar
  38. 38.
    McGregor, A.: Finding graph matchings in data streams. In: Proceedings of the 9th Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pp. 170–181 (2005)Google Scholar
  39. 39.
    McGregor, A., Vorotnikova, S.: Planar matching in streams revisited. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, 7–9 September, 2016, Paris, France, pp. 17:1–17:12, (2016)Google Scholar
  40. 40.
    McGregor, A., Vorotnikova, S.: A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs. In: 1st Symposium on Simplicity in Algorithms, SOSA 2018, 7–10 January, 2018, New Orleans, LA, USA, pp. 14:1–14:4 (2018)Google Scholar
  41. 41.
    Monemizadeh, M., Muthukrishnan, S., Peng, P., Sohler, C.: Testable bounded degree graph properties are random order streamable. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10–14 July, 2017, Warsaw, Poland, pp. 131:1–131:14 (2017)Google Scholar
  42. 42.
    Nguyen, H.N., and Onak, K.: Constant-time approximation algorithms via local improvements. In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, 25–28 October, 2008, Philadelphia, PA, USA, pp. 327–336 (2008)Google Scholar
  43. 43.
    Pagh, A., Pagh, R.: Uniform hashing in constant time and optimal space. SIAM J. Comput. 38(1), 85–96 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  44. 44.
    Paz, A., Schwartzman, G.: A (2+\(\epsilon \))-approximation for maximum weight matching in the semi-streaming model. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA vol. 2017, pp. 2153–2161 (2017)Google Scholar
  45. 45.
    Rabin, Michael O., Vazirani, Vijay V.: Maximum matchings in general graphs through randomization. J. Algorithms 10(4), 557–567 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  46. 46.
    Sarlós, T.: Improved approximation algorithms for large matrices via random projections. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 143–152 (2006)Google Scholar
  47. 47.
    Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107–111 (1947)MathSciNetCrossRefzbMATHGoogle Scholar
  48. 48.
    Uehara, R., Chen, Z.-Z.: Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1–2), 13–17 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  49. 49.
    Varadaraja, A.B.: Buyback problem—approximate matroid intersection with cancellation costs. In: Automata, Languages and Programming—38th International Colloquium, ICALP 2011, Zurich, Switzerland, 4–8 July, 2011, Proceedings, Part I, pp. 379–390 (2011)Google Scholar
  50. 50.
    Verbin, E., Yu, W.: The streaming complexity of cycle counting, sorting by reversals, and other problems. In: Proceedings of the 22th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 11–25 (2011)Google Scholar
  51. 51.
    Zelke, M.: Weighted matching in the semi-streaming model. Algorithmica 62(1–2), 1–20 (2012)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Zalando SEDortmundGermany
  2. 2.Purdue UniversityWest LafayetteUSA
  3. 3.University of MassachusettsAmherstUSA
  4. 4.AmazonPalo AltoUSA
  5. 5.Sapienza, University of RomeRomeItalia

Personalised recommendations