We discuss approximability in FPT-time for the class of subset optimization graph problems where a feasible solution S is a subset of the vertex set of the input graph. This class encompasses many well-known problems, such as min dominating set, min vertex cover, max independent set, min feedback vertex set. We study approximability of such problems with respect to the dual parameter n − k wher...

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the inventory-routing problem, which is a combination of distribution and inventory management. This paper considers a multi object...

We investigate the complexity of the MEMBERSHIP problem for some geometrically deened classes of Boolean functions, i.e., the complexity of deciding whether a Boolean function given in DNF belongs to the class. We give a general argument implying that this problem is co-NP-hard for any class having some rather benign closure properties. Applying this result we show that the MEMBERSHIP problem i...

background and aims. salivary glands are very susceptible to radiation and any disturbances in their function are detrimental to the hard tissues in the oral cavity. the aim of this study was to evaluate posterior class v dental caries in patients with head and neck cancers undergoing radiotherapy. materials and methods. in this study, twenty seven patients undergoing conventional radiotherapy ...