Author of the publication

Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner.

, , and . ACM Trans. Algorithms, 12 (2): 25:1-25:16 (2016)

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

Introduction to the Special Issue on SPAA 2013., and . ACM Trans. Parallel Comput., 2 (3): 14e:1-14e:2 (2015)Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights., , and . ACM Trans. Algorithms, 13 (3): 40:1-40:16 (2017)Lowest-Degree k-Spanner: Approximation and Hardness., and . Theory Comput., 12 (1): 1-29 (2016)Full Rank Tilings of Finite Abelian Groups.. SIAM J. Discret. Math., 20 (1): 160-170 (2006)Packing Interdiction and Partial Covering Problems., and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 157-168. Springer, (2013)The Norms of Graph Spanners., , and . ICALP, volume 132 of LIPIcs, page 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Approximating k-spanners in the LOCAL model., and . CoRR, (2017)Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics.. DISC, volume 5218 of Lecture Notes in Computer Science, page 152-166. Springer, (2008)Online and dynamic embeddings of approximate ultrametrics.. PODC, page 416. ACM, (2008)Brief announcement: distributed algorithms for approximating wireless network capacity.. PODC, page 328-329. ACM, (2009)