( en | de | ru )

 

Disambiguation of "Kapoor, Sanjiv"

Author of the publication

copydeleteadd this publication to your clipboard
A Simple and Efficient Algorithm for Computing Market Equilibria.

, , , , and . ACM Trans. Algorithms, 12 (3): 34:1-34:15 (2016)

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.

Sanjiv Gossain

Rishi Kapoor

Varun Kapoor

Pridhee Kapoor

Sanjiv Sarin

 

Other publications of authors with the same name

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees., , and . Algorithmica, 19 (4): 447-460 (1997)Price of Anarchy in Networks with Heterogeneous Latency Functions., and . Math. Oper. Res., 45 (2): 755-773 (2020)Proximity Structures for Geometric Graphs., and . Int. J. Comput. Geom. Appl., 20 (4): 415-429 (2010)Bounded-Diameter Minimum-Cost Graph Problems., and . Theory Comput. Syst., 41 (4): 779-794 (2007)Server allocation in a CDN., , and . ICC, page 3748-3752. IEEE, (2013)Approximate Euclidean Shortest Paths in Polygonal Domains., and . ISAAC, volume 149 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Price of Anarchy in network routing with class based capacity guarantees., , and . INFOCOM, page 2409-2417. IEEE, (2014)Economic inefficiency in resource allocation games., , and . Allerton, page 708-715. IEEE, (2017)Topics in the Design and Analysis of Combinatorial Algorithms. University of Illinois Urbana-Champaign, USA, (1986)An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case., , and . APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 128-138. Springer, (2004)