3 ms·
I wonder if there's any development of this, since this paper is from 2016. This is an example of an NP-hard problem that surprisingly broadly applies to every
by CrimsonCape 2y ago
I wonder if there's any development of this, since this paper is from 2016.
This is an example of an NP-hard problem that surprisingly broadly applies to everyday situations, just like the bin-packing problem that has been on the front page recently. Do you know of other NP hard problems with surprising applicability to everyday situations?
- ot 2y agoI haven't worked in this field for a while, but if you look at the citations of the paper [1] there are quite a few applications. One that I find very interesting is optimizing function layout in binaries to improve their compressibility [2], which is important for mobile apps. [1] https://scholar.google.com/scholar?cites=11964926064539313135&as_sdt=2005&sciodt=0,5&hl=en https://scholar.google.com/scholar?cites=1196492606453931313... [2] https://arxiv.org/pdf/2211.09285 https://arxiv.org/pdf/2211.09285
- b52_ 2y agoHey ot, We worked on improvements to this following our reproducibility study including a synchronized iterative version and alternative estimation functions. You can find the paper here if you're still interested! https://jmmackenzie.io/publication/tkde22/ https://jmmackenzie.io/publication/tkde22/