Weighted matching in the semi-streaming model

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 669-680

  Zelke, Mariano ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Approximation algorithm; Graph algorithm; Matching; Semi streaming algorithm

Indexed keywords

RANDOM ACCESS STORAGE;

APPROXIMATION RATIOS; GRAPH ALGORITHMS; MASSIVE GRAPH; MATCHING; RANDOM ACCESS; STREAMING ALGORITHM; STREAMING MODEL; WEIGHTED MATCHING;

APPROXIMATION ALGORITHMS;

EID: 45749100861     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. D. E. Drake Vinkemeier, S. Hougardy. A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms (TALG) 1(1), 107-122, 2005.
2. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. On graph problems in a semistreaming model. ICALP 2004, In: LNCS 3142, 531-543, 2004.
3. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. Graph Distances in the Streaming Model: The Value of Space. In: Proc. ACM-SIAM SODA (2005): 745-754, 2005.
4. H.N. Gabow. Data structures for weighted matchings and nearest common ancestors with linking. In: Proc. ACM-SIAM SODA (1990), 434-443, 1990.
5. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In: External Memory Algorithms, DIMACS Ser. in Discr. Math, and Theoret. Comp. Science, 50:107-118, 1999
6. A. McGregor. Finding Graph Matchings in Data Streams. APPROX and RANDOM 2005, In: LNCS 3624, 170-181, 2005.
7. R.H. Möhring, M. Müller-Hannemann. Complexity and modeling aspects of mesh refinement into quadrilaterals. Algorithmica 26, 148-171, 2000.
8. B. Monien, R. Preis, and R. Diekmann. Quality matching and local improvement for multilevel graph-partitioning. Paral. Comput. 26, 1609-1634, 2000.
9. S. Muthukrishnan. Data streams: Algorithms and applications. 2003. Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps
10. S. Pettie, P. Sanders. A simpler linear time 2/3-e approximation for maximum weight matching. Information Processing Letters 91(6), 271-276, 2004.
11. R. Preis. Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. STACS 1999, In: LNCS 1563, 259-269, 1999.
12. A. Schrijver. Combinatorial optimization: polyhedra and efficiency. Springer, Heidelberg, 2003.
13. M. Zelke. Optimal Per-Edge Processing Times in the Semi-Streaming Model. Information Processing Letters 104(3), 106-112, 2007.