6 research outputs found

    Minmax subtree cover problem on cacti

    Get PDF
    AbstractLet G=(V,E) be a connected graph such that edges and vertices are weighted by nonnegative reals. Let p be a positive integer. The minmax subtree cover problem (MSC) asks to find a pair (X,T) of a partition X={X1,X2,…,Xp} of V and a set T of p subtrees T1,T2,…,Tp, each Ti containing Xi so as to minimize the maximum cost of the subtrees, where the cost of Ti is defined to be the sum of the weights of edges in Ti and the weights of vertices in Xi. In this paper, we propose an O(p2n) time (4-4/(p+1))-approximation algorithm for the MSC when G is a cactus

    A review of network location theory and models

    Get PDF
    Cataloged from PDF version of article.In this study, we review the existing literature on network location problems. The study has a broad scope that includes problems featuring desirable and undesirable facilities, point facilities and extensive facilities, monopolistic and competitive markets, and single or multiple objectives. Deterministic and stochastic models as well as robust models are covered. Demand data aggregation is also discussed. More than 500 papers in this area are reviewed and critical issues, research directions, and problem extensions are emphasized.Erdoğan, Damla SelinM.S

    Brands of cumulants in non-commutative probability, and relations between them

    Get PDF
    The study of non-commutative probability revolves around the different notions of independeces, such as free, Boolean and monotone. To each type of independence one can associate a notion of cumulants that linearize the addition of independent random variables. These notions of cumulants are a clear analogue of classic cumulants that linearize the addition of independent random variables. The family of set partitions P plays a key role in the combinatorial study of probability because several formulas relating moments to a brand of cumulants can be expressed as a sum indexed by set partitions. An intriguing fact observed in the recent research literature was that non-commutative cumulants sometimes have applications to other areas of non-commutative probability than the one they were designed for. Thus one wonders if there are nice combinatorial formulas to directly transition from one brand of cumulants to another. This thesis is concerned with the study of interrelations between different brands of cumulants associated to classic, Boolean, free and monotone independences. My development is naturally divided in four topics. For the first topic I focus on free cumulants, and I use them in the study of the distribution of the anti-commutator ab + ba of two free random variables a and b. This follows up on some questions raised a while ago by Nica and Speicher in the 1990’s. I next consider the notion of convolution in the framework of a family of lattices, which goes back to work of Rota and collaborators in the 1970’s. I focus on the lattices of non-crossing partitions NC and put into evidence a certain group of semi-multiplicative functions, which encapsulate the moment-cumulant formulas and the inter-cumulant transition formulas for several known brands of cumulants in non-commutative probability. I next extend my considerations to the framework of P, which allows us to include the classical cumulants in the picture. Moreover, I do this in a more structured fashion by introducing a notion of iterative family of partitions S in P. This unifies the considerations related to NC and P, and also provides a whole gallery of new examples. Finally, it is important to make the observation that the group of semi-multiplicative functions which arise in connection to an iterative family is in fact a dual structure. Namely, it appears as the group of characters for a certain Hopf algebra over the partitions in S. In particular, the antipode promises to serve as a universal inversion tool for moment-cumulant formulas and for transition formulas between different brands of cumulants

    Collection of abstracts of the 24th European Workshop on Computational Geometry

    Get PDF
    International audienceThe 24th European Workshop on Computational Geomety (EuroCG'08) was held at INRIA Nancy - Grand Est & LORIA on March 18-20, 2008. The present collection of abstracts contains the 63 scientific contributions as well as three invited talks presented at the workshop

    Taxonomía, ecología y evolución de los rinocerontes (Rhinocerotidae, Perissodactyla) del mioceno de la Península Ibérica

    Full text link
    Tesis doctoral inédita leída en la Universidad Autónoma de Madrid, Facultad de Ciencias, Departamento de Biología. Fecha de lectura: 22-01-201
    corecore