Magnus Lie Hetland's user avatar
Magnus Lie Hetland's user avatar
Magnus Lie Hetland's user avatar
Magnus Lie Hetland
  • Member for 12 years, 3 months
  • Last seen more than a month ago
16 votes

Does every greedy algorithm have matroid structure?

3 votes
Accepted

Spell Checker with BK tree and edit distance that accounts for transpositions

6 votes

Non-metric distances

2 votes

How do top researchers keep track new results in datastructures

3 votes

Sort with random deviations

8 votes
Accepted

Fastest way to find an s-t min-cut from an s-t max-flow?

0 votes

Variation on longest path in a DAG

2 votes

Shortest number of editing move between two words

2 votes

Preprocessing Sparse, Directed Non-Planar Graphs for Faster Shortest Path

0 votes

Can Suffix trees be used to find all common substrings?

2 votes

Bibliography needed: How many "good" solutions for Knapsack?

3 votes
Accepted

Bin allocation problem

0 votes

Finding a subset of a set in a collection of sets

3 votes
Accepted

Shortest path in a DAG consisting of multiple copies of a smaller DAG

1 vote

Are there known NP-complete problems, neither NP-hard in the strong sense nor having pseudopolynomial algorithm?

4 votes

shortest path & max flow

5 votes
Accepted

Shortest Path Algorithm for large graph but short paths

9 votes
Accepted

Is it possible to prove that, for a given problem, no optimal greedy algorithms exist?

8 votes

Complexity of converting a boolean circuit to a boolean formula

0 votes

Complexity of marriage matching problem?