Showing results 1 to 3 of 3
| Title | Author(s) | Issue Date | |
|---|---|---|---|
A simple algorithm for finding all k-edge-connected components Journal:PLoS ONE | 2015 | ||
Approximation and competitive algorithms for single-minded selling problem Proceeding/Conference:The Twelfth International Conference on Algorithmic Aspects in Information and Management Proceedings | 2018 | ||
Offline and online algorithms for single-minded selling problem Journal:Theoretical Computer Science | 2020 |