Author of the publication

Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme.

, , and . SIAM J. Comput., 41 (3): 684-713 (2012)

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

A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing, and . CoRR, (2008)Sherali-adams relaxations of the matching polytope., and . STOC, page 293-302. ACM, (2009)Approximating Maximum Integral Multiflows on Bounded Genus Graphs., , , and . ICALP, volume 198 of LIPIcs, page 80:1-80:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Hierarchical Clustering: Objective Functions and Algorithms., , , and . J. ACM, 66 (4): 26:1-26:42 (2019)Large Very Dense Subgraphs in a Stream of Edges., and . FODS, page 107-117. ACM, (2020)Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm., , and . ITCS, volume 251 of LIPIcs, page 63:1-63:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On popularity-based random matching markets., , and . CoRR, (2019)Improved Approximation Algorithms for Budgeted Allocations., , , , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 186-197. Springer, (2008)Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme., , and . SIAM J. Comput., 41 (3): 684-713 (2012)Competitive Data-Structure Dynamization., , , and . SODA, page 2269-2287. SIAM, (2021)