Timeline for Is this knapsack variant named / studied? "Online algorithm for farthest-from-previous index"
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2024 at 4:17 | vote | accept | Erotemic | ||
| May 5, 2024 at 23:09 | answer | added | D.W.♦ | timeline score: 1 | |
| May 5, 2024 at 20:56 | comment | added | Erotemic | I'm not looking for a specific algorithm (although I am interested if you have one for the non-greedy variant). I'm more interested in existing related work. My research is in machine learning, so I'm not as up to date in theoretical CS papers as I would like to be. | |
| May 5, 2024 at 20:05 | comment | added | D.W.♦ | Do you have a running time requirement for the algorithm, or is any polynomial-time algorithm OK? | |
| May 5, 2024 at 19:41 | history | asked | Erotemic | CC BY-SA 4.0 |