A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimentally investigate the number of Pareto optimal knapsack fillings. Our experiments suggests that the theoretically proven upper bound of O(n 3 ) for uniform instances and O(φµn 4 ) for general probability distributions is not tight. Instead we conjecture an upper bound of O(φµn 2 ) matching a lower bound for adversarialdoi:10.1007/978-3-540-30140-0_55 fatcat:ernwloz6qfebrcbvab2znou5hu