( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets.

, и . CoRR, (2020)

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

Shree Harsha Vijaya Chandra

Nandhakumar Vijayakumar

 

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

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)Random Bichromatic Matchings., , , и . Algorithmica, 50 (4): 418-445 (2008)An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem., и . Algorithmica, 38 (3): 433-439 (2004)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)Random generation of combinatorial structures from a uniform distribution, , и . Theor. Comput. Sci., 43 (2-3): 169--188 (1986)Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract)., и . EC, стр. 202-203. ACM, (2003)Eisenberg-Gale markets: algorithms and structural properties., и . STOC, стр. 364-373. ACM, (2007)NP Is as Easy as Detecting Unique Solutions, и . STOC, стр. 458-463. ACM, (1985)The Steiner Tree Problem and Its Generalizations.. APPROX, том 1444 из Lecture Notes in Computer Science, стр. 33-38. Springer, (1998)