Weighted Matching in the Semi-Streaming Model
From MaRDI portal
Publication:4910759
DOI10.4230/LIPIcs.STACS.2008.1312zbMath1259.68240MaRDI QIDQ4910759
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_b10e.html
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Dynamic Approximate Vertex Cover and Maximum Matching, Unnamed Item, Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams, Submodular maximization meets streaming: matchings, matroids, and more, Intractability of min- and max-cut in streaming graphs, Optimal per-edge processing times in the semi-streaming model