Skip to main content
MathOverflow
Nick Russler's user avatar
Nick Russler's user avatar
Nick Russler's user avatar
Nick Russler
  • Member for 12 years, 6 months
Profile Activity

17 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Notable Question
awarded
 Popular Question
awarded
 Student
awarded
 Teacher
accepted
How to get the largest subset of a set of sets of intervals with no overlapping intervals
answered
How to get the largest subset of a set of sets of intervals with no overlapping intervals
comment
How to get the largest subset of a set of sets of intervals with no overlapping intervals
Maybe i dont understand the paper right, but as far as i can tell this paper only deals with a Set of Intervall's not a Set of Set's of Intervalls.
comment
How to get the largest subset of a set of sets of intervals with no overlapping intervals
Yeah, now i think hes right... We are looking for the maximum independent set... and that takes too much time.
awarded
 Scholar
awarded
 Editor
revised
How to get the largest subset of a set of sets of intervals with no overlapping intervals
edited body
revised
How to get the largest subset of a set of sets of intervals with no overlapping intervals
deleted 13 characters in body; edited title; edited body
asked
How to get the largest subset of a set of sets of intervals with no overlapping intervals
comment
Maximum subset of set of Integers with minimum distance
here i got my answer: stackoverflow.com/questions/10852535/…
revised
Maximum subset of set of Integers with minimum distance
edited tags
comment
Maximum subset of set of Integers with minimum distance
isn't this also a mathematical problem ? Something like the Knapsack problem ?
asked
Maximum subset of set of Integers with minimum distance