Weighted matching in a poly-streaming model
From MaRDI portal
Cites work
- A \((2+\epsilon)\)-approximation for maximum weight matching in the semi-streaming model
- A simple (1- )-approximation semi-streaming algorithm for maximum (weighted) matching
- Approximation algorithms in combinatorial scientific computing
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- scientific article; zbMATH DE number 7788450 (Why is no real title available?)
- scientific article; zbMATH DE number 7788452 (Why is no real title available?)
- Improved approximation guarantees for weighted matching in the semi-streaming model
- Improved streaming algorithms for weighted matching, via unweighted matching
- On graph problems in a semi-streaming model
- Semi-streaming algorithms for submodular function maximization under \(b\)-matching, matroid, and matchoid constraints
- Semi-streaming algorithms for weighted k-disjoint matchings
- Simplified and space-optimal semi-streaming (2+)-approximate matching
- Statistical mechanics of complex networks
- The University of Florida sparse matrix collection
- Total variation error bounds for geometric approximation
- Weighted matching in the semi-streaming model
- Weighted Matchings via Unweighted Augmentations
This page was built for publication: Weighted matching in a poly-streaming model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322404)
