"An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite ..."

Minjun Chang et al. (2020)

> Home

Details and statistics

DOI: 10.1007/S00224-019-09947-7

access: closed

type: Journal Article

metadata version: 2020-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/ChangHSV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/ChangHSV20
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. Theory Comput. Syst. 64(4): 645-661 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.