Tight approximation algorithms for maximum separable assignment problems
Year of publication: |
2011
|
---|---|
Authors: | Fleischer, Lisa ; Goemans, Michel X. ; Mirrokni, Vahab S. ; Sviridenko, Maxim |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 36.2011, 3, p. 416-431
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
-
A simple algorithm for solving Ramsey optimal policy with exogenous forcing variables
Chatelain, Jean-Bernard, (2017)
- More ...
-
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Fleischer, Lisa, (2011)
-
Dynamic mechanisms with martingale utilities
Balseiro, Santiago R., (2018)
-
Subjective-cost policy routing
Feigenbaum, Joan, (2005)
- More ...