-
Chapter and Conference Paper
Preserving Consistency for Liquid Knapsack Voting
Liquid Democracy (LD) uses transitive delegations to facilitate joint decision making. In its simplest form, it is used for binary decisions, however its promise holds also for more advanced voting settings. H...
-
Article
Open AccessOn the Cycle Augmentation Problem: Hardness and Approximation Algorithms
In the k-Connectivity Augmentation Problem we are given a k-edge-connected graph and a set of additional edges called links. Our goal is to find a set of links of minimum size whose addition to the graph makes it...
-
Chapter and Conference Paper
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
In the k-Connectivity Augmentation Problem we are given a k-edge-connected graph and a set of additional edges called links. Our goal is to find a set of links of minimum cardinality whose addition to the graph m...
-
Chapter and Conference Paper
PTAS for Minimax Approval Voting
We consider Approval Voting systems where each voter decides on a subset of candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k, minimizing the maximal Ham...
