Author image not provided
 Christos Kalaitzis

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.00
Citation Count8
Publication count8
Publication years2012-2017
Available for download5
Average downloads per article69.20
Downloads (cumulative)346
Downloads (12 Months)159
Downloads (6 Weeks)13
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


8 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 8 of 8
Sort by:

1 published by ACM
May 2017 ACM Transactions on Algorithms (TALG): Volume 13 Issue 3, August 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 87,   Downloads (Overall): 87

Full text available: PDFPDF
We study the basic allocation problem of assigning resources to players to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain Configuration-LP can be used to estimate the value of the optimal ...
Keywords: efficient local search, Approximation algorithms, fair allocation

2
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 36,   Downloads (Overall): 36

Full text available: PDFPDF
We consider the classic problem of scheduling jobs on unrelated machines so as to minimize the weighted sum of completion times. Recently, for a small constant ε > 0, Bansal et al. gave a (3/2 − ε )-approximation algorithm improving upon the "natural" barrier of 3/2 which follows from independent ...

3
January 2016 Theoretical Computer Science: Volume 610 Issue PB, January 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R d ) equipped with a distance function (e.g., the Euclidean distance � 2 ) and uses as address of each node ...
Keywords: Greedy embeddings, Stretch, Routing

4
January 2016 SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   Downloads (Overall): 47

Full text available: PDFPDF
We study the Maximum Budgeted Allocation problem, which is the problem of assigning indivisible items to players with budget constraints. In its most general form, an instance of the MBA problem might include many different prices for the same item among different players, and different budget constraints for every player. ...

5
December 2015 Mathematical Programming: Series A and B: Volume 154 Issue 1-2, December 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integrality gap of $$\frac{3}{4}$$34, which matches the ...
Keywords: 68W25

6
May 2015 Algorithmica: Volume 72 Issue 1, May 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network ...
Keywords: Algorithmic game theory, Price of stability, Equilibria, Network design

7
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Downloads (Overall): 71

Full text available: PDFPDF
We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain configuration-LP can be used to estimate the value of ...
Keywords: fair allocation, approximation algorithms, efficient local search

8 published by ACM
June 2012 SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 100

Full text available: PDFPDF
The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network ...
Keywords: network design games, equilibria, subsidies



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us