Computer Science
user avatar
user avatar
user avatar
Thomas Bosman
  • Member for 9 years, 2 months
  • Last seen more than a month ago
Profile Activity
Stats
499
reputation
7k
reached
8
answers
4
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
9
bronze badges
Top tags
View all tags
7
Score
3
Posts
25
Posts %
7
Score
3
Posts
25
Posts %
5
Score
5
Posts
42
Posts %
4
Score
2
Posts
17
Posts %
4
Score
2
Posts
17
Posts %
4
Score
1
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
4
Practical exponential time algorithms for polynomial-time solvable problems
Nov 4, 2015
question
4
Can we multiply approximation hardness?
Jan 26, 2017
answer
4
Real world applications for Steiner Tree Problem?
May 18, 2015
question
3
Time complexity 2-opt method
Mar 19, 2013
question
3
Hardness of approximation for Disjoint Group Steiner Tree
Aug 16, 2015
answer
3
Data structure for sparse matrices for an online problem
Jun 12, 2015
answer
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, 2015
answer
2
What is the best Approximation algorithm to schedule a task graph?
Jul 13, 2017
answer
1
Solving recurrences by substitution method: why can I introduce new constants?
Nov 10, 2015
answer
1
Decreasing a digraph's edge-weights while keeping net weights of edges at each vertex constant
May 20, 2015
Top network posts
View all network posts
24
A correct word for 'learnful'
6
Publishing on arXiv effect online scholarly profile
5
Difficulty being admitted to good PhD programs in the UK
5
Determining hardness using teeth

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.