Search for dissertations about: "exact bounds"

Showing result 1 - 5 of 44 swedish dissertations containing the words exact bounds.

  2. 1. Algorithms, measures and upper bounds for satisfiability and related problems

    Author : Magnus Wahlström; Peter Jonsson; Oliver Kullmann; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Exact algorithms; upper bounds; algorithm analysis; satisfiability; Computer science; Datavetenskap;

    Abstract : The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. READ MORE

  4. 2. Algorithmic Bounds for Presumably Hard Combinatorial Problems

    Author : Andreas Björklund; Institutionen för datavetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; control; Datalogi; numerical analysis; systems; Computer science; Approximation algorithms; Exact algorithms; NP-hard problems; Algorithm theory; kontroll;

    Abstract : 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. READ MORE

  5. 3. New Constructions for Competitive and Minimal-Adaptive Group Testing

    Author : Muhammad Azam Sheikh; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; strict group testing; disjoint pools; randomization; competitive group testing; minimal-adaptive group testing; exact bounds; competitive ratio;

    Abstract : Group testing (GT) was originally proposed during the World War II in an attempt to minimize the \emph{cost} and \emph{waiting time} in performing identical blood tests of the soldiers for a low-prevalence disease. Formally, the GT problem asks to find $d\ll n$ \emph{defective} elements out of $n$ elements by querying subsets (pools) for the presence of defectives. READ MORE

  6. 4. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings

    Author : Martin Wahlén; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Approximation Algorithms; Exact Algorithms; Time Complexity; Broadcasting;

    Abstract : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. READ MORE

  7. 5. High-order accurate calculations and bounds on effective properties of composites

    Author : Henrik Christiansson; KTH; []
    Keywords : ;

    Abstract : A classical problem in material science has been the studyof electrostatic and elastostatic properties of compositematerials. The complexity of the microstructure of randomcomposite media makes an exact calculation of the effectiveproperties very difficult. READ MORE