No label defined (Q5090980)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7561344

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561344

Statements

scholarly article

0 references

Sumedh Tirodkar

0 references

publication date

21 July 2022

0 references

zbMATH Keywords

semi-streaming

0 references

maximum matching

0 references

MaRDI profile type

MaRDI publication profile

0 references

Linear programming in the semi-streaming model with application to the maximum matching problem

0 references

On Estimating Maximum Matching Size in Graph Streams

0 references

Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model

0 references

Faster Fully Dynamic Matchings with Small Approximation Ratios

0 references

Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching

0 references

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time

0 references

Online Algorithms for Maximum Cardinality Matching with Edge Arrivals

0 references

Sublinear Estimation of Weighted Matchings in Dynamic Data Streams

0 references

Submodular maximization meets streaming: matchings, matroids, and more

0 references

Streaming Algorithms for Submodular Function Maximization

0 references

On Randomized Algorithms for Matching in the Online Preemptive Model

0 references

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams

0 references

Bipartite matching in the semi-streaming model

0 references

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model

0 references

Improved Bounds for Online Preemptive Matching

0 references

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond

0 references

On graph problems in a semi-streaming model

0 references

0 references

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams

0 references

Better bounds for matchings in the streaming model

0 references

Approximating matching size from random streams

0 references

Maximum Matching in Turnstile Streams

0 references

Maximum Matching in Semi-streaming with Few Passes

0 references

Online bipartite matching with random arrivals

0 references

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

0 references

A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

Weighted Matching in the Semi-Streaming Model

0 references

Identifiers

10.4230/LIPIcs.FSTTCS.2018.39

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5090980

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5090980&oldid=36832498"