( en | de | ru )

 

Disambiguation of "Vazirani, Vijay V."

Author of the publication

copydeleteadd this publication to your clipboard
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem.

, and . Algorithmica, 38 (3): 433-439 (2004)

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.

Balakumar Vijayakrishnan

Preethi Vijayaraj

Bharadwaj Vijaysarathy

Nandhakumar Vijayakumar

Shree Harsha Vijaya Chandra

 

Other publications of authors with the same name

An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case., and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 149-155. Springer, (2003)A Fast Parallel Algorithm for Finding a Maximal Bipartite Set., and . FSTTCS, volume 472 of Lecture Notes in Computer Science, page 225-231. Springer, (1990)Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)., and . ICALP, volume 623 of Lecture Notes in Computer Science, page 366-377. Springer, (1992)Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets., and . WINE, volume 4858 of Lecture Notes in Computer Science, page 362-367. Springer, (2007)The Steiner Tree Problem and Its Generalizations.. APPROX, volume 1444 of Lecture Notes in Computer Science, page 33-38. Springer, (1998)On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs., , and . ITW, page 211. IEEE, (2006)A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm.. IPCO, page 509-530. University of Waterloo Press, (1990)A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem., , , and . SODA, page 484-489. ACM/SIAM, (1999)Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees., , and . SODA, page 357-366. ACM/SIAM, (1992)An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem., and . Algorithmica, 38 (3): 433-439 (2004)