General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching.
Saved in:
| Title: | General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. |
|---|---|
| Authors: | Ezra, Tomer1, tomer.ezra@gmail.com, Feldman, Michal2, mfeldman@tauex.tau.ac.il, Gravin, Nick3, nikolai@mail.shufe.edu.cn, Tang, Zhihao Gavin3, tang.zhihao@mail.shufe.edu.cn |
| Source: | EC: Economics & Computation; 2022, p1148-1177, 30p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
