Search for dissertations about: "Exponential-time algorithm"

Showing result 1 - 5 of 6 swedish dissertations containing the words Exponential-time algorithm.

  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. On Some Combinatorial Optimization Problems : Algorithms and Complexity

    Author : Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

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

  5. 3. Efficient Use of Exponential Size Linear Programs

    Author : Lukas Polacek; Johan Håstad; Nikhil Bansal; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; approximation algorithms; linear programming; allocation problems; Computer Science; Datalogi;

    Abstract : In the past decades, linear programming (LP) has been successfully used to develop approximation algorithms for various optimization problems. In particular, the so-called assignment LP has lead to substantial progress for various allocation problems, including scheduling unrelated parallel machines. 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. What would have happened? : Four essays investigating causality

    Author : Fredrik Sävje; Eva Mörk; Per Johansson; Niklas Bengtsson; Kosuke Imai; Uppsala universitet; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Nationalekonomi; Economics;

    Abstract : This dissertation consists of four self-contained essays.Essay 1. A common method to reduce the uncertainty of causal inferences from experiments is to assign treatments in fixed proportions within groups of similar units: blocking. READ MORE