Sökning: "perfect matching"

Visar resultat 1 - 5 av 18 avhandlingar innehållade orden perfect matching.

  1. 1. Employment Dynamics

    Författare :Karolina Stadin; Nils Gottfries; Bertil Holmlund; Eran Yashiv; Uppsala universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Employment dynamics; Labor demand; Matching; Vacancies; Unemployment; Business cycle; Firm behavior; Capital stock; Inventories;

    Sammanfattning : The main focus of this thesis is the employment decisions of firms. The thesis consists of three self-contained but closely related essays, all enlightening employment dynamics in different ways. The thesis is mainly empirical but there are also some theoretical developments when existing theory is insufficient to explain the empirical findings. LÄS MER

  3. 2. On random satisfiability and optimization problems

    Författare :Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

    Sammanfattning : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. LÄS MER

  4. 3. Essays on Delegated Search and Temporary Work Agencies

    Författare :Tomas Raattamaa; Magnus Wikström; Thomas Aronsson; Mats Bergman; Umeå universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; delegated search; principal-agent; matching; transition probability; temporary work agencies; nationalekonomi; Economics;

    Sammanfattning : Paper [I] models a game, where two temporary work agencies (TWAs) compete to fill a vacancy at a client firm (CF). They simultaneously choose how much effort to expend, based on their expectation of how good their opponent’s best candidate will be. LÄS MER

  5. 4. On random cover and matching problems

    Författare :Joel Larsson; Klas Markström; Tatyana Turova; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; matematik;

    Sammanfattning : This thesis consists of the following papers.I  J. Larsson, The Minimum Matching in Pseudo-dimension 0 < q < 1, submittedII  V. Falgas-Ravry, J. LÄS MER

  7. 5. Snarks : Generation, coverings and colourings

    Författare :Jonas Hägglund; Roland Häggkvist; Klas Markström; Luis Goddyn; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Snarks; cubic graphs; enumeration; cycle covers; perfect matching covers; Fulkerson s conjecture; strong cycle double cover conjecture; cycle decompositions; stable cycles; oddness; circumference; uncolourability measures; Mathematics; matematik;

    Sammanfattning : For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson's conjecture and Tutte's 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll's poem, a \emph{snark} is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. LÄS MER