The check-my-algorithm tag has no wiki summary.
6
votes
2answers
53 views
Compute relational composition in $O(|E||V|)$
Definitions: Let $G=(V,E)$ be a DAG without self-loops, and $X \subseteq G$ and $Y \subseteq G$ be graphs.
Input: $X,Y$. Output: The relational composition relational composition $X \circ Y$ in ...
6
votes
2answers
161 views
Maximise sum of “non-overlapping” numbers in square array - help with proof
A question was posted on Stack Overflow asking for an algorithm to solve this problem:
I have a matrix (call it A) which is nxn. I wish to select a subset
(call it B) of points from matrix A. ...
4
votes
1answer
124 views
What is the complexity of this subset merge algorithm?
Updated Algorithm: There was a major flaw in my original presentation of the algorithm which could have impacted the results. I apologize for the same. The correction has been posted underneath.
The ...
1
vote
1answer
471 views
Inventory planning problem solved through dynamic programming
I am working on problem (15-11) Inventory planning from Introduction to Algorithms (CLRS, 3rd Ed).
15-11: Inventory Planning, p.411
The Rinky Dink Company makes machines that resurface ice ...
