Timeline for Given a large binary matrix, find the largest submatrix containing non-zero elements
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:56 | history | edited | CommunityBot | replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/ | |
| Feb 28, 2016 at 7:33 | history | edited | unlikely | CC BY-SA 3.0 | added 720 characters in body |
| Feb 27, 2016 at 21:03 | comment | added | unlikely | @tavr Please check my other answer with LinearProgramming but don't expect some magic... | |
| Feb 27, 2016 at 20:51 | comment | added | tavr | Can you describe in more detail how to do this faster? As it is, the approach is not very scalable (# elements in objective function \[Proportional] to mxn) | |
| Feb 27, 2016 at 19:16 | history | edited | unlikely | CC BY-SA 3.0 | deleted 11 characters in body |
| Feb 27, 2016 at 19:04 | history | edited | unlikely | CC BY-SA 3.0 | added 542 characters in body |
| Feb 27, 2016 at 18:53 | history | answered | unlikely | CC BY-SA 3.0 |