scientific article; zbMATH DE number 7561344

DOI10.4230/LIPIcs.FSTTCS.2018.39MaRDI QIDQ5090980

Sumedh Tirodkar

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum matchingsemi-streaming

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items (1)

Markovian online matching algorithms on large bipartite random graphs

Cites Work

• Unnamed Item
• Submodular maximization meets streaming: matchings, matroids, and more
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Linear programming in the semi-streaming model with application to the maximum matching problem
• Bipartite matching in the semi-streaming model
• On graph problems in a semi-streaming model
• Improved Bounds for Online Preemptive Matching
• Maximum Matching in Semi-streaming with Few Passes
• Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
• Streaming Algorithms for Submodular Function Maximization
• Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
• On Randomized Algorithms for Matching in the Online Preemptive Model
• Maximum Matching in Turnstile Streams
• Faster Fully Dynamic Matchings with Small Approximation Ratios
• Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
• Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
• Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log³ n) Worst Case Update Time
• On Estimating Maximum Matching Size in Graph Streams
• A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model
• Weighted Matching in the Semi-Streaming Model
• Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
• Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
• Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
• Approximating matching size from random streams
• Online bipartite matching with random arrivals
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Better bounds for matchings in the streaming model

This page was built for publication: