Author of the publication

Online competitive algorithms for maximizing weighted throughput of unit jobs.

, , , , , and . J. Discrete Algorithms, 4 (2): 255-276 (2006)

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

Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?, and . Algorithmica, 37 (3): 149-164 (2003)Haplotype Inference on Pedigrees Without Recombinations., , , , and . Encyclopedia of Algorithms, (2016)Optimal Online Two-Way Trading with Bounded Number of Transactions.. Algorithmica, 81 (11-12): 4238-4257 (2019)Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes., , and . Discret. Comput. Geom., 26 (4): 499-511 (2001)On-line scheduling of equal-length intervals on parallel machines., , and . Inf. Process. Lett., 112 (10): 376-379 (2012)A tight lower bound for job scheduling with cancellation., , , , and . Inf. Process. Lett., 97 (1): 1-3 (2006)Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees., and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 172-184. Springer, (2001)Maximizing Throughput in Energy-Harvesting Sensor Nodes.. ALGOSENSORS, volume 9536 of Lecture Notes in Computer Science, page 129-141. Springer, (2015)Online Scheduling of Unit Length Jobs with Commitment and Penalties.. IFIP TCS, volume 8705 of Lecture Notes in Computer Science, page 54-65. Springer, (2014)Efficient algorithms for finding a longest common increasing subsequence., , , , and . J. Comb. Optim., 13 (3): 277-288 (2007)