11 citations · 38 across the 16 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 1 cited
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
Penny Haxell, Tibor Szabó
In the max-min allocation problem a set of players are to be allocated disjoint subsets of a set of indivisible resources, such that the minimum utility among all players i…
cs.DS2019
Algorithms for weighted independent transversals and strong colouring
Alessandra Graf, David G. Harris, Penny Haxell
An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are k…