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

On Optimal Strategies for a Hat Game on Graphs.. SIAM J. Discret. Math., 24 (3): 782-791 (2010)On picking sequences for chores., and . EC, page 626-655. ACM, (2023)Fair Shares: Feasibility, Domination and Incentives., and . EC, page 435. ACM, (2022)Fair Allocations for Smoothed Utilities., , , and . EC, page 436-465. ACM, (2022)A Greedy Approximation Algorithm for Minimum-Gap Scheduling., , , , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 97-109. Springer, (2013)Edge Coloring and Decompositions of Weighted Graphs., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 405-416. Springer, (2008)Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT Example.. RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 189-196. Springer, (1999)Short Tours through Large Linear Forests., , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 273-284. Springer, (2014)Easily Refutable Subformulas of Large Random 3CNF Formulas., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 519-530. Springer, (2004)A Fast Randomized LOGSPACE Algorithm for Graph Connectivity.. ICALP, volume 820 of Lecture Notes in Computer Science, page 499-507. Springer, (1994)