Christos Kalaitzis
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Improved approximation for tree augmentation: saving by rewiring Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Combinatorial algorithm for restricted max-min fair allocation ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Unrelated machine scheduling of jobs with uniform Smith ratios Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| An improved approximation guarantee for the maximum budgeted allocation problem Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Combinatorial Algorithm for Restricted Max-Min Fair Allocation Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Space lower bounds for low-stretch greedy embeddings Theoretical Computer Science | 2015-12-10 | Paper |
| On the configuration LP for maximum budgeted allocation Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
| Enforcing efficient equilibria in network design games via subsidies Algorithmica | 2015-05-21 | Paper |
| On the configuration LP for maximum budgeted allocation Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| Space lower bounds for low-stretch greedy embeddings Structural Information and Communication Complexity | 2012-09-26 | Paper |
Research outcomes over time
This page was built for person: Christos Kalaitzis
