Andreas S. Schulz

activity

20182021

most citedApproximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing 2018Show all

1 paper · 1 filter

cs.GT2018

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses

Yiannis Giannakopoulos, Georgy Noarov, Andreas S. Schulz

We present a deterministic polynomial-time algorithm for computing $d^{d + o (d)}$ -approximate (pure) Nash equilibria in (proportional sharing) weighted congestion games with polynomi…