stacs 2021 | tight approximation guarantees for concave coverage problems
Published 3 years ago • 43 plays • Length 24:41Download video MP4
Download video MP3
Similar videos
-
23:21
stacs 2021 | achieving anonymity via weak lower bound constraints for k-median and k-means
-
27:53
stacs 2021 | a faster algorithm for finding tarski fixed points
-
24:52
stacs 2021 | quantum approximate counting with nonadaptive grover iterations
-
24:16
stacs 2021 | a nearly optimal deterministic online algorithm for non-metric facility location
-
26:30
stacs 2021 | improved (provable) algorithms for the shortest vector problem via…
-
16:19
stacs 2021 | finding an optimal alphabet ordering for lyndon factorization is hard
-
23:39
stacs 2021| the approximation ratio of the 2-opt heuristic for the euclidean traveling salesman p...
-
8:10
out in snow|germany| saarbrücken
-
3:57
walking around aimlessly in the saarland university campus
-
7:02
saarbrücken vlog, germany , europe 🇩🇪❤️
-
26:28
stacs 2021 | reachability in two-parametric timed automata with one parameter is expspace-complete
-
21:09
stacs 2021 | parameterised counting in logspace
-
21:59
stacs 2021 | geometric cover with outliers removal
-
24:31
stacs 2021 | bidimensional linear recursive sequences and universality of unambiguous register au...
-
24:18
stacs 2021 | good r-divisions imply optimal amortized decremental biconnectivity
-
0:41
student animation: the future of university campus | university of saarland
-
21:43
stacs 2021 | rice-like theorems for automata networks