Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Towards a better understanding of randomized greedy matching

From MaRDI portal
Publication:5144995
Jump to:navigation, search

DOI10.1145/3357713.3384265OpenAlexW3035000752MaRDI QIDQ5144995

Yu-Hao Zhang, Xiaowei Wu, Zhihao Gavin Tang

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.05135


zbMATH Keywords

oblivious matchingrandomized greedy matchingrandomized primal dual


Mathematics Subject Classification ID

Theory of computing (68Qxx)


Related Items (1)

Greedy Matching in Bipartite Random Graphs




This page was built for publication: Towards a better understanding of randomized greedy matching

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5144995&oldid=19690087"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 15:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki