Approximating connected facility location problems via Random facility sampling and core detouring

We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unconnected facility location problem, randomly sample the clients, and open the facilities serving sampled clients in the approximate solution. Via a novel analytical tool, which we term core detouring, we show that this approach significantly improves over the previously best known approximation ratios for several NP-hard network design problems. For example, we reduce the approximation ratio for the connected facility location problem from 8.55 to 4.00 and for the single-sink rent-or-buy problem from 3.55 to 2.92. We show that our connected facility location algorithms can be derandomized at the expense of a slightly worse approximation ratio. The versatility of our framework is demonstrated by devising improved approximation algorithms also for other related problems

The safety evaluation of food flavoring substances: the role of genotoxicity studies

The Flavor and Extract Manufacturers Association (FEMA) Expert Panel relies on the weight of evidence from all available data in the safety evaluation of flavoring substances. This process includes data from genotoxicity studies designed to assess the potential of a chemical agent to react with DNA or otherwise cause changes to DNA, either in vitro or in vivo. The Panel has reviewed a large number of in vitro and in vivo genotoxicity studies during the course of its ongoing safety evaluations of flavorings. The adherence of genotoxicity studies to standardized protocols and guidelines, the biological relevance of the results from those studies, and the human relevance of these studies are all important considerations in assessing whether the results raise specific concerns for genotoxic potential. The Panel evaluates genotoxicity studies not only for evidence of genotoxicity hazard, but also for the probability of risk to the consumer in the context of exposure from their use as flavoring substances. The majority of flavoring substances have given no indication of genotoxic potential in studies evaluated by the FEMA Expert Panel. Examples illustrating the assessment of genotoxicity data for flavoring substances and the consideration of the factors noted above are provided. The weight of evidence approach adopted by the FEMA Expert Panel leads to a rational assessment of risk associated with consumer intake of flavoring substances under the conditions of use

FEMA GRAS assessment of natural flavor complexes: Sage oil, Orris Root Extract and Tagetes Oil and related flavoring ingredients

In recent years, the Expert Panel of the Flavor and Extract Manufacturers Association (FEMA) has conducted a program to re-evaluate the safety of natural flavor complexes (NFCs) used as flavor ingredients. This publication, twelfth in the series, details the re-evaluation of NFCs whose constituent profiles are characterized by alicyclic or linear ketones. In its re-evaluation, the Expert Panel applies a scientific constituent-based procedure for the safety evaluation of NFCs in commerce using a congeneric group approach. Estimated intakes of each congeneric group of the NFC are evaluated using the well-established and conservative Threshold of Toxicological Concern (TTC) approach. In addition, studies on the toxicity and genotoxicity of members of the congeneric groups and the NFCs under evaluation are reviewed. The scope of the safety evaluation of the NFCs contained herein does not include added use in dietary supplements or any products other than food. Thirteen (13) NFCs derived from the Boronia, Cinnamomum, Thuja, Ruta, Salvia, Tagetes, Hyssopus, Iris, Perilla and Artemisia genera are affirmed as generally recognized as safe (GRAS) under conditions of their intended use as flavor ingredients based on an evaluation of each NFC and the constituents and congeneric groups therein

Reasoning with global assumptions in arithmetic modal logics

We establish a generic upper bound ExpTime for reasoning with global assumptions in coalgebraic modal logics. Unlike earlier results of this kind, we do not require a tractable set of tableau rules for the in- stance logics, so that the result applies to wider classes of logics. Examples are Presburger modal logic, which extends graded modal logic with linear inequalities over numbers of successors, and probabilistic modal logic with polynomial inequalities over probabilities. We establish the theoretical upper bound using a type elimination algorithm. We also provide a global caching algorithm that offers potential for practical reasoning

On the Complexity of the Asymmetric VPN Problem

We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (VPN) problem with arbitrary concave costs. We even show the stronger result, that there is always a tree solution of cost at most 2 OPT and that a tree solution of (expected) cost at most 49.84 OPT can be determined in polynomial time. Furthermore, we answer an outstanding open question about the complexity status of the so called balanced VPN problem by proving its NP-hardness