Robust Assignments via Ear Decompositions and Randomized Rounding

Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in scheduling problems, where a set of tasks needs to be assigned to the available set of machines or personnel (resources), in a way that all tasks have assigned resources, and no two tasks share the same resource. In its nominal form, the resulting computational problem becomes the \emph{assignment problem} on general bipartite graphs. This paper deals with a robust variant of the assignment problem modeling situations where certain edges in the corresponding graph are \emph{vulnerable} and may become unavailable after a solution has been chosen. The goal is to choose a minimum-cost collection of edges such that if any vulnerable edge becomes unavailable, the remaining part of the solution contains an assignment of all tasks. We present approximation results and hardness proofs for this type of problems, and establish several connections to well-known concepts from matching theory, robust optimization and LP-based techniques.Comment: Full version of ICALP 2016 pape

Computer Aided Aroma Design. I. Molecular knowledge framework

Computer Aided Aroma Design (CAAD) is likely to become a hot issue as the REACH EC document targets many aroma compounds to require substitution. The two crucial steps in CAMD are the generation of candidate molecules and the estimation of properties, which can be difficult when complex molecular structures like odours are sought and when their odour quality are definitely subjective whereas their odour intensity are partly subjective as stated in Rossitier’s review (1996). In part I, provided that classification rules like those presented in part II exist to assess the odour quality, the CAAD methodology presented proceeds with a multilevel approach matched by a versatile and novel molecular framework. It can distinguish the infinitesimal chemical structure differences, like in isomers, that are responsible for different odour quality and intensity. Besides, its chemical graph concepts are well suited for genetic algorithm sampling techniques used for an efficient screening of large molecules such as aroma. Finally, an input/output XML format based on the aggregation of CML and ThermoML enables to store the molecular classes but also any subjective or objective property values computed during the CAAD process

d-extensibles de stables dans les graphes bipartis

International audienc

Three concepts of rights, two of property

Sometimes rights are taken to describe concrete, bottom-line entitlements, sometimes a kind of ground of such entitlements. I suggest that this difference reflects not so much disagreement or uncertainty as to the nature of rights as different applications and senses of the term ‘right’, each expressing a different idea or concept. Much work on rights is compromised by a failure to distinguish these concepts of a right, nowhere more so than in private law, where it accounts for difficulties lawyers have faced when seeking to distinguish personal (in personam) and proprietary (in rem) rights

Optimization of a mixer-ejector system for supersonic civilian transport aircraft

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1998.Includes bibliographical references (p. 183-185).by Brian Scott Teeple.Ph.D

Tom Gregory v. Mark Shurtleff : Brief of Plaintiff/Appellant

APPEAL FROM SUMMARY JUDGMENT ORDERS ENTERED BY THIRD JUDICIAL DISTRICT COURT, THE HONORABLE L. A. DEVER PRESIDING

Kentucky Tax Law, Second Edition

A reference for Kentucky lawyers on real and personal property taxation, Kentucky sales and use taxation, Kentucky individual income taxation, corporate income taxation, and procedures before the Kentucky Board of Tax Appeals