Tight approximation for unconstrained XOS maximization
Year of publication: |
2021
|
---|---|
Authors: | Filmus, Yuval ; Kawase, Yasushi ; Kobayashi, Yusuke ; Yamaguchi, Yutaro |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 46.2021, 4, p. 1599-1610
|
Subject: | approximation algorithms | value oracles | XOS functions | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Goerigk, Marc, (2023)
-
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Baïou, Mourad, (2023)
-
Tight approximation bounds for combinatorial frugal coverage algorithms
Caragiannis, Ioannis, (2013)
- More ...
-
A Price Is a Signal: on Intrinsic Motivation, Crowding-out, and Crowding-in
Iwata, Satoru, (2010)
-
The complexity of minimizing the difference of two M⇋-convex set functions
Kobayashi, Yusuke, (2015)
-
Otsuki, Kensuke, (2016)
- More ...