On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing
Event details
| Date | 15.03.2019 |
| Hour | 17:00 |
| Speaker | Igor MALINOVIC |
| Location | |
| Category | Thesis defenses |
Thesis Directors: Prof. F. Eisenbrand - Prof. Y. Faenza
Mathematics doctoral program
Thesis Nr. 9277
Practical information
- General public
- Free