Author of the publication

Approximation Algorithms for the Joint Replenishment Problem with Deadlines.

, , , , , , , and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 135-147. Springer, (2013)

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

Preemptive scheduling of equal-length jobs to maximize weighted throughput., , , , and . Oper. Res. Lett., 32 (3): 258-264 (2004)LP-rounding algorithms for the fault-tolerant facility placement problem., and . J. Discrete Algorithms, (2015)On Huang and Wong's algorithm for generalized binary split trees., , , and . Acta Informatica, 59 (6): 687-708 (2022)A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue., , , , , , and . Theor. Comput. Sci., (2013)Classification via two-way comparisons., and . CoRR, (2023)On Fast Algorithms for Two Servers., and . J. Algorithms, 12 (4): 607-614 (1991)Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms., and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 185-193. Springer, (1998)Faster Algorithms for k-Medians in Trees., , , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 218-227. Springer, (2003)Nondeterminism Is Essential for Two-Way Counter Machines.. MFCS, volume 176 of Lecture Notes in Computer Science, page 240-244. Springer, (1984)Together or Separate? Algorithmic Aggregation Problems.. FCT, volume 8070 of Lecture Notes in Computer Science, page 1. Springer, (2013)