Timeline for Enumerating weighted permutations in sorted order problem
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2013 at 4:57 | comment | added | Yuval Filmus | There is no problem with that. We want a mechanism $M$ (which you can think of as an object in the sense of OOP) which has a function "next" that outputs the next subset, in increasing order of total weight. We want "next" to be as fast as possible (either in the "worst" case, that is for each call, or on average, that is amortized), and $M$ to use as little memory as possible. $M$ can also presumably take some (reasonable amount of) time to initialize. | |
| Nov 5, 2013 at 17:54 | history | answered | Ilya Gazman | CC BY-SA 3.0 |