A Tale of Santa Claus, Hypergraphs and Matroids
A Tale of Santa Claus, Hypergraphs and Matroids
复制标题
圣诞老人、超图和拟阵的故事
DOI:
10.1137/1.9781611975994.167
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Zhang, Yihao
中科院分区:
文献类型:
--
作者:
Davies, Sami;Rothvoss, Thomas Rothvoss;Zhang, Yihao
A well-known problem in scheduling and approximation algorithms is the Santa Claus problem. Suppose that Santa Claus has a set of gifts, and he wants to distribute them among a set of children so that the least happy child is made as happy as possible. Here, the value that a childihas for a presentjis of the formpijϵ {0,pj}. A polynomial time algorithm by Annamalai et al. gives a 12.33-approximation and is based on a modification of Haxell's hypergraph matching argument.In this paper, we introduce amatroidversion of the Santa Claus problem. Our algorithm is also based on Haxell's augmenting tree, but with the introduction of the matroid structure we solve a more general problem with cleaner methods. Our result can then be used as a blackbox to obtain a (4 +ϵ)-approximation for Santa Claus. This factor also compares against a natural, compact LP for Santa Claus.
登录
查看更多内容
DOI:
10.1007/978-0-387-30162-4_28
发表时间:
2021-08
期刊:
Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97)
影响因子:
--
作者:
通讯作者:
--
影响因子:
2
作者:
José Verschae;Andreas Wiese
通讯作者:
Andreas Wiese
DOI:
10.1145/1993636.1993718
发表时间:
2010-11
期刊:
Proceedings of the forty-third annual ACM symposium on Theory of computing
影响因子:
--
作者:
O. Svensson
通讯作者:
O. Svensson
DOI:
10.1016/j.ipl.2020.106025
发表时间:
2018
期刊:
ArXiv
影响因子:
--
作者:
K. Jansen;L. Rohwedder
通讯作者:
L. Rohwedder
DOI:
10.4230/oasics.sosa.2018.11
发表时间:
2018
期刊:
影响因子:
--
作者:
K. Jansen;L. Rohwedder
通讯作者:
L. Rohwedder