Intractability of min- and max-cut in streaming graphs

Information Processing Letters

Volumn 111, Issue 3, 2011, Pages 145-150

  Zelke, Mariano ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Graph algorithms; Intractability; Max cut; Min cut; Streaming algorithms

Indexed keywords

GRAPH ALGORITHMS; INTRACTABILITY; MAX-CUT; MIN-CUT; STREAMING ALGORITHM;

ALGORITHMS;

EID: 78649332391     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.10.017     Document Type: Article

References (30)

1. K.J. Ahn, and S. Guha Graph sparsification in the semi-streaming model Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09) LNCS vol. 5556 2009 Springer Berlin/Heidelberg 328 338
2. A. Aho, J. Hopcroft, and J. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Publishing Company
3. B. Babcock, S. Babu, M. Datar, R. Motwani, J. Widom, Models and issues in data stream systems, in: Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'02), 2002, pp. 1-16.
4. F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt An application of combinatorial optimization to statistical physics and circuit layout design Oper. Res. 36 1988 493 513
5. Z. Bar-Yossef, R. Kumar, D. Sivakumar, 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'02), 2002, pp. 623-632.
6. S. Baswana Streaming algorithm for graph spanners - single pass and constant processing time per edge Inform. Process. Lett. 106 2008 110 114
7. 2) time, in: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing STOC '96, 1996, pp. 47-55.
8. R. Botafogo, Cluster analysis for hypertext systems, in: Proceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1993, pp. 116-125.
9. A. Buchsbaum, R. Giancarlo, and J. Westbrook On finding common neighborhoods in massive graphs Theoret. Comput. Sci. 299 2003 707 718
10. L. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, C. Sohler, Counting triangles in data streams, in: Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'06), 2006, pp. 253-262.
11. M. Elkin Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07) LNCS vol. 4596 2007 Springer Berlin/Heidelberg 716 727
12. L. Epstein, A. Levin, J. Mestre, D. Segev, Improved approximation guarantees for weighted matching in the semi-streaming model, in: 27th International Symposium on Theoretical Aspects of Computer Science STACS 2010, 2010, pp. 347-358.
13. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang On graph problems in a semi-streaming model Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04) LNCS vol. 3142 2004 Springer Berlin/Heidelberg 531 543
14. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, J. Zhang, Graph distances in the streaming model: the value of space, in: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), 2005, pp. 745-754.
15. L.R. Ford, and D.R. Fulkerson Maximal flow through a network Canad. J. Math. 8 1956 399 404
16. H.N. Gabow A matroid approach to finding edge connectivity and packing arborescences J. Comput. System Sci. 50 2 1995 259 273
17. S. Ganguly, and B. Saha On estimating path aggregates over streaming graphs Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC'06) LNCS vol. 4288 2006 Springer Berlin/Heidelberg 163 172
18. M.R. Garey, and D.S. Johnson Computers and Intractability - A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company
19. M.X. Goemans, and D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. ACM 42 1995 1115 1145
20. J. Håstad Some optimal inapproximability results J. ACM 48 2001 798 869
21. M.R. Henzinger, P. Raghavan, and S. Rajagopalan Computing on data streams External Memory Algorithms DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 50 1999 AMS/DIMACS 107 118
22. H. Jowhari, and M. Ghodsi New streaming algorithms for counting triangles in graphs Proceedings of the 11th Annual International Computing and Combinatorics Conference (COCOON '05) LNCS vol. 3595 2005 Springer Berlin/Heidelberg 710 716
23. R.M. Karp Reducibility among combinatorial problems Complexity of Computer Computations 1972 Plenum Press New York 85 103
24. S. Khot, G. Kindler, E. Mossel, R. O'Donnell, Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? in: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), 2004, pp. 146-154.
25. E. Kushilevitz, and N. Nisan Communication Complexity 1997 Cambridge University Press
26. A. McGregor Finding graph matchings in data streams Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 9th International Workshop on Randomization and Computation (APPROX and RANDOM '05) LNCS vol. 3624 2005 Springer Berlin/Heidelberg 170 181
27. S. Muthukrishnan Data Streams: Algorithms and Applications Foundations and Trends in Theoretical Computer Science 2005 Now Publishers Inc. http://algo.research.googlepages.com/eight.ps
28. M. Zelke Optimal per-edge processing times in the semi-streaming model Inform. Process. Lett. 104 3 2007 106 112
29. M. Zelke, Weighted matching in the semi-streaming model, in: Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science (STACS'08), 2008, pp. 669-680.
30. M. Zelke, Algorithms for streaming graphs, PhD thesis, Humboldt University, Berlin, 2009, http://nbn-resolving.de/urn:nbn:de:kobv:11-10097652.