inapproximability相关论文
Approximation Algorithms for Two Variants of Multiple Knapsack Problem with Restricted Bipartite Gra
Given n items with different sizes si and profits pi, m knapsacks with different capacities cj and a restricted bipa......
假设有p台计算机,n张载有信息的网页,其各网页的长度都与计算机和时间有关,现在的问题是,求一个安排.使这p台计算机能在最短的时间内下......