Scholar
Ask a question and accept an answer.
Awarded 11327 times.
Awarded Apr 22 at 8:27
Awarded Apr 21 at 6:42
Awarded Apr 21 at 4:43
Awarded Apr 20 at 18:57
Awarded Apr 20 at 16:17
Awarded Apr 19 at 15:34
Awarded Apr 18 at 21:27
Awarded Apr 16 at 20:42
Awarded Apr 14 at 19:00
Awarded Apr 12 at 0:33
Awarded Apr 11 at 12:08
Awarded Apr 9 at 17:26
Awarded Apr 8 at 17:03
Awarded Apr 7 at 3:31
Awarded Apr 5 at 10:22
Awarded Apr 5 at 1:16
Awarded Apr 4 at 23:41
Awarded Apr 4 at 1:11
Awarded Apr 3 at 15:04
Awarded Apr 3 at 12:57
Awarded Apr 1 at 22:21
Awarded Mar 31 at 14:31
Awarded Mar 31 at 9:02
Awarded Mar 30 at 20:17
Awarded Mar 28 at 19:49
Awarded Mar 27 at 16:36
Awarded Mar 24 at 20:22
Awarded Mar 24 at 18:25
Awarded Mar 24 at 12:52
Awarded Mar 22 at 18:56
Awarded Mar 22 at 12:57
Awarded Mar 22 at 11:21
Awarded Mar 22 at 7:42
Awarded Mar 21 at 14:27
Awarded Mar 21 at 10:25
Awarded Mar 20 at 20:34
Awarded Mar 20 at 6:18
Awarded Mar 20 at 5:10
Awarded Mar 18 at 15:12
Awarded Mar 15 at 23:27
Awarded Mar 15 at 21:18
Awarded Mar 15 at 17:11
Awarded Mar 15 at 7:05
Awarded Mar 14 at 20:55
Awarded Mar 14 at 18:56
Awarded Mar 14 at 18:40
Awarded Mar 14 at 13:34
Awarded Mar 14 at 13:26
Awarded Mar 14 at 12:26
Awarded Mar 13 at 19:35
Awarded Mar 13 at 13:21
Awarded Mar 13 at 2:09
Can we prove the greedy algorithm archives 1.5-approximation for the Minimal Dominating Set Problem?
Awarded Mar 12 at 13:11
Awarded Mar 11 at 18:16
Awarded Mar 11 at 17:07
Awarded Mar 11 at 14:15
Awarded Mar 11 at 12:50
Awarded Mar 10 at 22:49
Awarded Mar 10 at 14:09
Awarded Mar 10 at 9:47