Alain Hertz
, Romain Montagné and François Gagnon
Technical Report (2016)
An external link is available for this item| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| Research Center: | GERAD - Research Group in Decision Analysis |
| PolyPublie URL: | https://publications.polymtl.ca/64071/ |
| Report number: | G-2016-111 |
| Official URL: | https://www.gerad.ca/fr/papers/G-2016-111 |
| Date Deposited: | 25 Apr 2025 14:30 |
| Last Modified: | 25 Apr 2025 14:30 |
| Cite in APA 7: | Hertz, A., Montagné, R., & Gagnon, F. (2016). Online algorithms for the maximum k-colorable subgraph problem. (Technical Report n° G-2016-111). https://www.gerad.ca/fr/papers/G-2016-111 |
|---|---|
Statistics
Stats are not available on this system.
Repository Staff Only
|
View Item |
