11 citations · 25 across the 25 of their papers we have counts for
3 papers · 1 filter
FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares
Klaus Jansen, Alexandra Lassota, Malte Tutas +1
We study the computational complexity of fairly allocating indivisible, mixed-manna items. For basic measures of fairness, this problem is hard in general. Thus, research has flour…
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems
F. Bruce Shepherd, Adrian Vetta
We consider single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node and a set of demands that we want to send to th…
Routing Regardless of Network Stability
Bundit Laekhanukit, Adrian Vetta, Gordon Wilfong
We examine the effectiveness of packet routing in this model for the broad class next-hop preferences with filtering. Here each node v has a filtering list D(v) consisting of nodes…