Near-optimal asymmetric binary matrix partitions
We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (Proceedings of the 9th Conference on Web and Internet Economics (WINE), pp 1–14, 2013). Instances of the problem consist of an n× m binary matrix A and a probability distribution over its columns. A...
Auteurs principaux: | Abed, F, Caragiannis, I, Voudouris, AA |
---|---|
Format: | Journal article |
Publié: |
Springer
2016
|
Documents similaires
-
Optimizing positional scoring rules for rank aggregation
par: Caragiannis, I, et autres
Publié: (2018) -
Determination of the optimal shape of matrix elements partitioning on three abstract heterogeneous processors
par: Ye.G Klyuyeva, et autres
Publié: (2020-01-01) -
Measuring precession in asymmetric compact binaries
par: Geraint Pratten, et autres
Publié: (2020-10-01) -
Multistage Adaptive Robust Binary Optimization: Uncertainty Set Lifting versus Partitioning through Breakpoints Optimization
par: Farough Motamed Nasab, et autres
Publié: (2023-09-01) -
Partition and composition matrices: two matrix analogues of set partitions
par: Anders Claesson, et autres
Publié: (2011-01-01)