Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
Hao Mao
Peter Malec
Yoko Kawawa
Mykolai Protsenko
Hyungwon Kim
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Paper
/
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities.
Paper Info
Open Visualization
Title
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities.
Year
DOI
Venue
2021
10.4230/LIPIcs.APPROX/RANDOM.2021.2
APPROX/RANDOM
DocType
Citations
PageRank
Conference
0
0.34
References
Authors
0
2
Authors (2 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
Susanne Albers
1
111
15.98
Sebastian Schubert
2
0
1.01
1