Timeline for Sum of k vectors with largest possible norm
Current License: CC BY-SA 4.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 2 at 22:37 | comment | added | Roberto Imbuzeiro Oliveira | Thanks, @SandeepSilwal! The paper does not quite prove APX-hardness for the fixed-k problem, but it surely is a relevant reference. | |
Sep 2 at 18:34 | comment | added | Sandeep Silwal | This appears to be APX-hard sciencedirect.com/science/article/pii/S0304397518302408 | |
Sep 2 at 17:56 | history | edited | Michael Hardy | CC BY-SA 4.0 |
added 22 characters in body
|
Sep 2 at 17:41 | history | asked | Roberto Imbuzeiro Oliveira | CC BY-SA 4.0 |