In the question: Compendium of the Best Approximation and Hardness Results for NP optimization problems, it is pointed out that a wiki for computational problems similar to Complexity Zoo can be beneficial for the researchers. It is a great help for researchers to know the best algorithmic results (lower and/or bound) related to a problem. Apparently, the zoo people started a new wiki for computational problems: complexity garden. I contacted the editors of complexity garden and they agreed to devote this wiki to algorithmic results of problems in addition to its original complexity related scope.
Now, I would like to announce this opportunity to populate the Garden. I can add an answer to the above question, but I think not many people will see that. Is there anyway to announce this using cstheory.stackexchange?