"Matching on the Line Admits no o(√log n)-Competitive Algorithm."

Enoch Peserico, Michele Scquizzato (2023)

> Home

Details and statistics

DOI: 10.1145/3594873

access: closed

type: Journal Article

metadata version: 2023-08-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/PesericoS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/PesericoS23
Enoch Peserico, Michele Scquizzato:
Matching on the Line Admits no o(√log n)-Competitive Algorithm. ACM Trans. Algorithms 19(3): 28:1-28:4 (2023)

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.