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 Fast and Simple Algorithm for Computing Market Equilibria.

L. Fleischer, R. Garg, S. Kapoor, R. Khandekar, and A. Saberi. WINE, volume 5385 of Lecture Notes in Computer Science, page 19-30. Springer, (2008)

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.

Lisa Hoss University of Stuttgart

Lisa Schröder University of Stuttgart

Lisa Schöllhammer University of Stuttgart

Lisa Binanzer University of Stuttgart

Lisa Hörnig University of Stuttgart

Other publications of authors with the same name

Faster Algorithms for the Quickest Transshipment Problem.L. Fleischer. SIAM Journal on Optimization, 12 (1): 18-35 (2001)Universally maximum flow with piecewise-constant capacities.L. Fleischer. Networks, 38 (3): 115-125 (2001)Preference-constrained Oriented Matching.L. Fleischer, and Z. Svitkina. ANALCO, page 66-73. SIAM, (2010)Tight approximation algorithms for maximum general assignment problems.L. Fleischer, M. Goemans, V. Mirrokni, and M. Sviridenko. SODA, page 611-620. ACM Press, (2006)Minimum cost flows over time without intermediate storage.L. Fleischer, and M. Skutella. SODA, page 66-75. ACM/SIAM, (2003)Strict Cost Sharing Schemes for Steiner Forest.L. Fleischer, J. Könemann, S. Leonardi, and G. Schäfer. SIAM J. Comput., 39 (8): 3616-3632 (2010)Quickest Flows Over Time.L. Fleischer, and M. Skutella. SIAM J. Comput., 36 (6): 1600-1630 (2007)Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.L. Fleischer. FOCS, page 24-31. IEEE Computer Society, (1999)Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines.L. Fleischer, and Z. Wang. SAGT, volume 6982 of Lecture Notes in Computer Science, page 166-177. Springer, (2011)The Quickest Multicommodity Flow Problem.L. Fleischer, and M. Skutella. IPCO, volume 2337 of Lecture Notes in Computer Science, page 36-53. Springer, (2002)