Computer Science
Meta user
Network profile
429
reputation
2
9

Thomas Bosman

Apparently, this user prefers to keep an air of mystery about them.

8
answers
4
questions
~5k
people reached
  • Member for 6 years, 7 months
  • 30 profile views
  • Last seen Feb 2 at 22:45

Communities (13)

Top network posts

Top tags (24)

Score 7
Posts 3
Posts % 25
Score 7
Posts 3
Score 5
Posts 5
Score 4
Posts 2
Score 4
Posts 2
Score 4
Posts 1
View all tags →

Top posts (12) All Questions Answers | Votes Newest

4 Real world applications for Steiner Tree Problem? May 18 '15
4 Can we multiply approximation hardness? Jan 26 '17
4 Practical exponential time algorithms for polynomial-time solvable problems Nov 4 '15
3 Hardness of approximation for Disjoint Group Steiner Tree Aug 16 '15
3 Time complexity 2-opt method Mar 19 '13
3 Data structure for sparse matrices for an online problem Jun 12 '15
2 What is the best Approximation algorithm to schedule a task graph? Jul 13 '17
2 How can an maximum flow algorithm for directed graphs, i.e. Edmond-Karp, be adapted to compute a minimum $s$-$t$ cut in a undirected graph? Jun 3 '15
1 Solving recurrences by substitution method: why can I introduce new constants? Nov 10 '15
1 Can someone help me come up with a formula for calculating the difference in time? Jun 2 '15
View all questions and answers →

Badges (11)

Gold

—

Silver

2

Rarest

Bronze

9

Rarest

View all badges →