Author of the publication

Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency.

, , , and . J. ACM, 67 (1): 7:1-7:33 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks., , , and . SIAM J. Discret. Math., 32 (3): 1903-1921 (2018)Optimal Fault-Tolerant Distributed Construction of a Spanning Forest.. Inf. Process. Lett., 27 (6): 299-307 (1988)Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks or: Traversing one way streets with no map.. ICCC, page 446-452. International Council for Computer Communication / Elsevier, (1988)Fast and compact self stabilizing verification, computation, and fault detection of an MST., , and . PODC, page 311-320. ACM, (2011)A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms., , and . PODC, page 163-174. ACM, (1985)Dynamic Wavelength Allocation in Optical Networks., , , and . PODC, page 293. ACM, (1997)Optimal maintenance of a spanning tree., , and . J. ACM, 55 (4): 18:1-18:45 (2008)Maintenance of a Spanning Tree in Dynamic Networks., and . DISC, volume 1693 of Lecture Notes in Computer Science, page 342-355. Springer, (1999)Optimal Computation of Global Sensitive Functions in Fast Networks., , and . WDAG, volume 486 of Lecture Notes in Computer Science, page 185-191. Springer, (1990)Greedy Packet Scheduling., , , and . WDAG, volume 486 of Lecture Notes in Computer Science, page 169-184. Springer, (1990)