Greedy metric minimum online matchings with random arrivals
Year of publication: |
2019
|
---|---|
Authors: | Gairing, Martin ; Klimm, Max |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 2, p. 88-91
|
Subject: | Random arrival | Matching | Greedy algorithm | Approximation | Theorie | Theory | Algorithmus | Algorithm |
-
A greedy algorithm for the two-level nested logit model
Li, Guang, (2014)
-
Approximate Pareto sets of minimal size for multi-objective optimization problems
Bazgan, Cristina, (2015)
-
A greedy algorithm for solving ordinary transportation problem with capacity constraints
Liu, Fang, (2017)
- More ...
-
Hiring secretaries over time : the benefit of concurrent employment
Disser, Yann, (2020)
-
Covering games: approximation through non-cooperation
Gairing, Martin, (2009)
-
Total latency in singleton congestion games
Gairing, Martin, (2007)
- More ...