0
$\begingroup$

I'm wondering if algorithms described in:

https://ieeexplore.ieee.org/abstract/document/7782946/

http://drops.dagstuhl.de/opus/volltexte/2014/4845/

easy to implement. They seem to mention the word "simple" but I'm not sure if this is all just theoretical play of "who's going to find the best $O$", or if this can be implemented in a sane amount of time (a couple of weeks).

$\endgroup$
3
  • $\begingroup$ I'm not sure this is a good fit for this site. $\endgroup$ Commented Apr 25, 2018 at 14:53
  • $\begingroup$ I'm just wondering if polynomial time approximation schemes used here are implementable. $\endgroup$
    – Looft
    Commented May 2, 2018 at 14:57
  • $\begingroup$ Have you tried implementing them? $\endgroup$ Commented May 2, 2018 at 15:07

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.