Author of the publication

Approximation Through Local Optimality: Designing Networks with Small Degree.

, , and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 279-290. Springer, (1992)

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

Redeeming Nested Dissection: Parallelism Implies Fill., , , and . PPSC, (1999)Approximating k-cuts via network strength., and . SODA, page 621-622. ACM/SIAM, (2002)When cycles collapse: A general approximation technique for constrained two-connectivity problems., and . IPCO, page 39-55. CIACO, (1993)Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons., , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 66-76. PMLR, (2020)Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem., , , and . SODA, page 619-628. ACM/SIAM, (1997)We know who you followed last summer: inferring social link creation times in twitter., , , , , and . WWW, page 517-526. ACM, (2011)Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 169-180. Springer, (2006)Randomized Approximation Algorithms for Query Optimization Problems on Two Processors., , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 649-661. Springer, (2002)Approximation Through Local Optimality: Designing Networks with Small Degree., , and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 279-290. Springer, (1992)On Two-Stage Stochastic Minimum Spanning Trees., , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 321-334. Springer, (2005)