### Questions (16)

 4 Ordered set cover problem: is it NP-hard? 4 Is this scheduling problem with arrival times, deadlines, and costs NP-hard? 2 How to partition a set in order to minimize the number of the elements and their interactions? 2 Cover the maximum of elements 2 How to define the potential function method for an online maximization problem?

### Reputation (566)

 +40 NP-hard problems but only for n≥3 +18 Assigning Balls to Bins with Constraints on Which Ball to Go to Which Bin? +10 Matching Upper Bound for Online Problems +10 Selecting Columns with Minimum Overlaps

 6 Find median of unsorted array in $O(n)$ time 4 NP-hard problems but only for n≥3 3 How to solve T(n)=2T(√n)+log n with the master theorem? 2 Solving recursion $T(n)=2T(n/2) +2/\log(n)$ 1 On if then condition in linear programming?

### Tags (17)

 6 algorithms × 11 1 linear-programming × 2 6 time-complexity 0 np-hard × 7 5 recurrence-relation × 3 0 knapsack-problems × 2 4 np-complete × 5 0 online-algorithms × 2 3 master-theorem 0 learning-theory