"General Graphs are Easier than Bipartite Graphs: Tight Bounds for ..."

Tomer Ezra et al. (2022)

> Home

Details and statistics

DOI: 10.1145/3490486.3538290

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sigecom/EzraFGT22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigecom/EzraFGT22
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. EC 2022: 1148-1177

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.