Approximating Semi-matchings in Streaming and in Two-Party Communication (Q4962609)
From MaRDI portal
(Redirected from Item:Q5326598)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating Semi-matchings in Streaming and in Two-Party Communication |
scientific article; zbMATH DE number 6195462
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Semi-matchings in Streaming and in Two-Party Communication |
scientific article; zbMATH DE number 6195462 |
Statements
Approximating Semi-matchings in Streaming and in Two-Party Communication (English)
0 references
5 November 2018
0 references
6 August 2013
0 references
semi-matchings
0 references
communication complexity
0 references
job assignment
0 references
streaming algorithms
0 references
0.9999999
0 references
0.9030798
0 references
0.89186984
0 references
0.89186984
0 references
0.88866925
0 references
0.88866925
0 references
0.8882064
0 references
0.8821519
0 references
0.8780757
0 references
