Christos Kalaitzis Authors: Add personal information
 Affiliation history
Bibliometrics: publication history
SEARCH
ROLE
Author only

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 8 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 8 of 8 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 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: PDF 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: PDF 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: PDF 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: PDF 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 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: PDF 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