( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Price of Anarchy, Locality Gap, and a Network Service Provider Game.

, , , , , и . WINE, том 3828 из Lecture Notes in Computer Science, стр. 1046-1055. Springer, (2005)

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.

Balakumar Vijayakrishnan

Preethi Vijayaraj

Bharadwaj Vijaysarathy

Nandhakumar Vijayakumar

Shree Harsha Vijaya Chandra

 

Другие публикации лиц с тем же именем

A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm.. IPCO, стр. 509-530. University of Waterloo Press, (1990)A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities., , , и . SIAM J. Comput., 44 (6): 1820-1847 (2015)An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem., и . Algorithmica, 38 (3): 433-439 (2004)Nonseparable, Concave Utilities Are Easy - in a Perfect Price Discrimination Market Model.. SIAM J. Discret. Math., 27 (1): 266-273 (2013)A real polynomial for bipartite graph minimum weight perfect matchings., и . Inf. Process. Lett., (2023)Convex Program Duality, Fisher Markets, and Nash Social Welfare., , , , , , и . CoRR, (2016)An Improved Definition of Blossoms and a Simpler Proof of the MV Matching Algorithm. CoRR, (2012)The game of survival: Sexual evolution in dynamic environments., , , , и . CoRR, (2015)A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem., , , и . SODA, стр. 484-489. ACM/SIAM, (1999)Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees., , и . SODA, стр. 357-366. ACM/SIAM, (1992)