Author of the publication

An improved approximation ratio for the minimum linear arrangement problem.

, and . Inf. Process. Lett., 101 (1): 26-29 (2007)

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.

 

Other publications of authors with the same name

The Noisy Oracle Problem., , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 284-296. Springer, (1988)A Tight Negative Example for MMS Fair Allocations., , and . WINE, volume 13112 of Lecture Notes in Computer Science, page 355-372. Springer, (2021)On Best-of-Both-Worlds Fair-Share Allocations., , and . WINE, volume 13778 of Lecture Notes in Computer Science, page 237-255. Springer, (2022)Fair-Share Allocations for Agents with Arbitrary Entitlements., , and . EC, page 127. ACM, (2021)A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium., and . SAGT, volume 6386 of Lecture Notes in Computer Science, page 138-149. Springer, (2010)On the Hardness of Computing the Permanent of Random Matrices., and . Comput. Complex., 6 (2): 101-132 (1997)A polylogarithmic approximation of the minimum bisection., and . FOCS, page 105-115. IEEE Computer Society, (2000)Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e., and . FOCS, page 667-676. IEEE Computer Society, (2006)Share-Based Fairness for Arbitrary Entitlements., and . CoRR, (2024)Chasing Ghosts: Competing with Stateful Policies., , and . FOCS, page 100-109. IEEE Computer Society, (2014)