Michele Flammini

TL;DR: Almost completely the impact of selfishness and greediness in load balancing is characterized by presenting new and improved, tight or almost tight bounds on the price of anarchy of selfish load balancing as well as on the competitiveness of the greedy algorithm for online load balancing when the objective is to minimize the total latency of all clients on servers with linear latency functions.

TL;DR: Almost completely the impact of selfishness and greediness in load balancing is characterized by presenting new and improved, tight or almost tight bounds on the price of anarchy and price of stability of selfish load balancing as well as on the competitiveness of the greedy algorithm for online load balancing when the objective is to minimize the total latency of all clients on servers with linear latency functions.

TL;DR: A 4-approximation algorithm for general instances, and approximation algorithms with improved ratios for instances with bounded lengths, for instance where any two intervals intersect, and for instances where no interval is properly contained in another.

TL;DR: The existence proofs are based on classical arguments from the divisible cake-cutting setting, and involve discrete analogues of cut-and-choose, of Stromquist's moving-knife protocol, and of the Su-Simmons argument based on Sperner's lemma.

TL;DR: This paper investigates the problem of minimizing the number of locations to place regenerators in optical networks and presents analytical results regarding the complexity of this problem, including polynomial time algorithms, NP-completeness results, approximation algorithms, and inapproximability results.