Timeline for A variation of Set Cover
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2023 at 1:14 | comment | added | Jackson | Thanks for the great answer! So an approximation algorithm for the 3-dim matching problem can give an approximation to the optimal number of required sets (or least number of neighborhoods based on my recent edit to the question) in my problem too, right? | |
| Apr 24, 2023 at 11:01 | history | answered | LeechLattice | CC BY-SA 4.0 |