Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.

K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar. Theor. Comput. Sci., 410 (44): 4489-4503 (2009)

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.

No persons found for author name Rao, Satish

add a person with the name Rao, Satish

Other publications of authors with the same name

Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps.F. Leighton, B. Maggs, and S. Rao. Combinatorica, 14 (2): 167-186 (1994)Flows in Undirected Unit Capacity Networks.A. Goldberg, and S. Rao. SIAM J. Discrete Math., 12 (1): 1-5 (1999)Computing Vertex Connectivity: New Bounds from Old Techniques.M. Henzinger, S. Rao, and H. Gabow. J. Algorithms, 34 (2): 222-250 (2000)Faster Shortest-Path Algorithms for Planar Graphs.M. Henzinger, P. Klein, S. Rao, and S. Subramanian. J. Comput. Syst. Sci., 55 (1): 3-23 (1997)Fast Approximate Graph Partitioning Algorithms.G. Even, J. Naor, S. Rao, and B. Schieber. SODA, page 639-648. ACM/SIAM, (1997)A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar. Theor. Comput. Sci., 410 (44): 4489-4503 (2009)Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.F. Leighton, and S. Rao. J. ACM, 46 (6): 787-832 (1999)Expander flows, geometric embeddings and graph partitioning.S. Arora, S. Rao, and U. Vazirani. J. ACM, 56 (2): 5:1-5:37 (2009)Beyond the Flow Decomposition Barrier.A. Goldberg, and S. Rao. J. ACM, 45 (5): 783-797 (1998)Query Strategies for Evading Convex-Inducing ClassifiersB. Nelson, B. Rubinstein, L. Huang, A. Joseph, S. Lee, S. Rao, and J. Tygar. CoRR, (2010)

PUMA

Disambiguation of "Rao, Satish"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Rao, Satish"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.