Christos Kalaitzis

According to our database, Christos Kalaitzis authored at least 8 papers between 2015 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Improved approximation for tree augmentation: saving by rewiring.

Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Applications of Strong Convex Relaxations to Allocation Problems.

Christos Kalaitzis

PhD thesis, 2017

Combinatorial Algorithm for Restricted Max-Min Fair Allocation.

Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson

ACM Trans. Algorithms, 2017

Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios.

Christos Kalaitzis, Ola Svensson, Jakub Tarnawski

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Space lower bounds for low-stretch greedy embeddings.

Ioannis Caragiannis, Christos Kalaitzis

Theor. Comput. Sci., 2016

An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem.

Christos Kalaitzis

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

On the configuration LP for maximum budgeted allocation.

Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson

Math. Program., 2015

Enforcing Efficient Equilibria in Network Design Games via Subsidies.

John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis

Algorithmica, 2015