https://netotz.github.io/tags/data-structures/ Recent content in data structures on void? Hugo -- gohugo.io en Tue, 26 Jul 2022 00:00:00 +0000 https://netotz.github.io/posts/a-fvs/ Tue, 26 Jul 2022 00:00:00 +0000 https://netotz.github.io/posts/a-fvs/ Introduction Earlier in the year I wrote about how the objective function of an optimization problem is decomposed and partially evaluated so an algorithm that uses that function runs faster. I found this technique so interesting that I tried to explain it in that post. But the goal wasn’t to just understand the decomposing of an objective function. I needed to design a fast algorithm to solve the $\alpha$-neighbor $p$-center problem (ANPCP), as I mentioned in the other post, and while researching to do so, I came across the concept of the fast interchange or fast swap and how it was applied to other location problems (not the ANPCP).