3 citations · 5 across the 4 of their papers we have counts for
3 papers · 1 filter
Upper Domination: towards a dichotomy through boundary properties
Hassan AbouEisha, Shahid Hussain, Vadim Lozin +3
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally N…
Subset Sum Problems With Digraph Constraints
Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight d…
Efficient Reallocation under Additive and Responsive Preferences
Haris Aziz, Peter Biro, Jerome Lang +2
Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. While finding an arbitrary Pareto optimal allocation is general…