Sökning: "combinatorial problems"

Visar resultat 1 - 5 av 73 avhandlingar innehållade orden combinatorial problems.

  1. 1. Combinatorial Optimization Three Applications

    Detta är en avhandling från Karlskrona : Blekinge Institute of Technology

    Författare :Efraim Laksman; Blekinge Tekniska Högskola.; [2012]

    Sammanfattning : Combinatorial optimization is a diverse area of mathematics. It concerns optimization on feasible regions defined by discrete sets, graphs, hypergraphs, matroids, etc. . . LÄS MER

  2. 2. On Some Combinatorial Optimization Problems Algorithms and Complexity

    Detta är en avhandling från Linköping : Linköping University Electronic Press

    Författare :Hannes Uppman; Linköpings universitet.; Linköpings universitet.; [2015]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

    Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER

  3. 3. Combinatorial Slice Theory

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Mateus de Oliveira Oliveira; KTH.; [2013]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Combinatorial Slice Theory; Partial Order Theory of Concurrency; Digraph Width Measures; Equational Logic;

    Sammanfattning : Slices are digraphs that can be composed together to form larger digraphs.In this thesis we introduce the foundations of a theory whose aim is to provide ways of defining and manipulating infinite families of combinatorial objects such as graphs, partial orders, logical equations etc. LÄS MER

  4. 4. Algorithmic Bounds for Presumably Hard Combinatorial Problems

    Detta är en avhandling från Datavetenskap LTH

    Författare :Andreas Björklund; Lunds universitet.; Lund University.; [2007]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; control; Datalogi; numerical analysis; systems; Computer science; Approximation algorithms; Exact algorithms; NP-hard problems; Algorithm theory; kontroll;

    Sammanfattning : In this thesis we present new worst case computational bounds on algorithms for some of the most well-known NP-complete and #P-complete problems and their optimization variants. We consider graph problems like Longest Path, Maximum Cut, Number of Perfect Matchings, Chromatic and Domatic Number, as well as Maximum k-Satisfiability and Set Cover. LÄS MER

  5. 5. Efficient Parallel Algorithms for Combinatorial Problems

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Oscar Garrido Gómez; [1996]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Matematik; Mathematics; Data- och systemvetenskap; computer technology; Systems engineering; matchings.; independent sets; graphs; parallel algorithms;

    Sammanfattning : This thesis is concerned with the design of efficient parallel algorithms for some optimization graph problems. A subset S of vertices or edges in a graph G is said to be maximum with respect to a property if, among all the subsets of G having this property, S is one having the largest cardinality. LÄS MER