Memory paging for connectivity and path problems in graphs.
Average case analysis of fully dynamic reachability for directed graphs
Full approximability of a class of problems over power sets.
In this paper results concerning structural and approximability properties of the subclass of NP-Complete Optimization Problems, defined over a lattice are considered. First, various approaches to the concept of Fully Polynomial Approximation Scheme are presented with application to several known problems in the class of NP-Complete Optimization Problems. Secondly, a characterization of full Approximability for the class of Max Subset Problems is introduced.
Page 1