Gai Ling

Ling Gai

Information about the author Ling Gai will soon be added to the site.
Found 2 papers in total
Hardness of lazy packing and covering
2009
We prove APX-hardness for the two problems maximum resource bin packing and lazy bin...
On lazy bureaucrat scheduling with common deadlines
2008
Lazy bureaucrat scheduling is a new class of scheduling problems introduced by Arkin...
Papers per page: