approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
Published 8 years ago • 208 plays • Length 26:50Download video MP4
Download video MP3
Similar videos
-
29:31
parallelization by approximation
-
34:11
low diameter graph decompositions and approximating unique games
-
45:46
a (slightly) improved approximation algorithm for metric tsp
-
37:13
parameterized and promised streaming
-
31:42
on approximating the covering radius and finding dense lattice subspaces
-
33:06
lower bounds for subexponential parameterized complexity of minimum fill-in and related problems
-
40:01
approximation algorithms for optimization under uncertainty
-
29:28
subexponential parameterized complexity of completion problems: survey of the upper bounds
-
12:08
minimax approximation and the exchange algorithm
-
29:47
parameterized inapproximability of max k-subset intersection under eth
-
22:43
orthogonal vectors is hard for first-order properties on sparse graphs