Work

Tight Bounds for Secretary Matching in General Graphs

Year: 2024

Type: article

Source: Mathematics of Operations Research

DOI: 10.1287/moor.2022.0206

Authors: Tomer Ezra, Michal Feldman, Nikolai Gravin, Zhihao (Gavin) Tang

Institutions: Harvard University, Tel Aviv University, Microsoft (Israel), Shanghai University of Finance and Economics

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4404717018

FWCI:

Cites: 22

Cited by:

Related to: 10