Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 11 of 11 for “"polynomial algorithm"”.
-
Near-Optimal Learning and Planning in Separated Latent MDPs
… under the optimal policy, there is a quasi-polynomial algorithm with time complexity scaling in terms of the statistical threshold. We further show a near-matching time complexity lower bound under the exponential time hypothesis.
-
Random games
… terms of complexity, the resulting "permutation algorithm" is orthogonal to the classical, strategy-based algorithms: it is exponential in the number of random states, but not in the number of controlled states. We also present an improvement heuristic for this algorithm, inspired by the …
-
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)
… into two smaller problems. The result is a polynomial algorithm which finds a minimum-delay routing assignment by solving a series of static maximum-flow problems. In order to apply the above ideas to dynamic networks with continuously-varying capacities, a continuous network is defined …
-
Combinatorial optimization and recognition of graph classes with applications to related models
… models that enable the design of new efficient algorithms. In particular, we first investigate the classes of interval and proper interval graphs, and especially, path problems on them. These classes of graphs have been extensively studied and they find many applications in several fields and …
-
High resolution modal analysis using poles obtained at a single location
… from the accelerometer FRF using the Rational Polynomial algorithm. Mode vectors were then estimated from the 472 SLV FRFs for the first 6 modes (1 rigid body + 5 flexible). A comparison of the results was given between the proposed method and a standard global parameter estimation technique. …
-
Optimizing safety stock placement in general network supply chains
… service time models and provides an algorithm for safety stock placement in general-network supply chains. We first show that the general problem is NP-hard. Next, we develop several conditions that characterize an optimal solution of the general-network problem. We find that we can …
-
Structural and algorithmic aspects of linear inequality systems
… Research, but many fundamental structural and algorithmic questions about linear inequality systems remain unanswered. This thesis considers and addresses some of these questions. In the first chapter, we reconsider the ellipsoid algorithm applied to solving a system of linear inequalities. …
-
Parametric computation of equilibria and flows
… complexity of computing these flows and develop algorithms solving this task. In contrast to the basic static flow models that are widely studied in the literature, we mainly focus on parametric flow models. In particular, we consider settings where the demands, i.e., the external in- and outflow …
-
Min Cost Flow in balancierten Netzwerken mit konvexer Kostenfunktion
… Stone. Using these results we present several algorithms to solve the Convex BMCF problem. We present the first complete version of the Primal-Dual algorithm previously studied by Fremuth-Paeger and Jungnickel. However, we only consider the case of positive costs. We also show how to apply this …
-
Multiple domination in graphs
… for some graph classes this problem turns polynomial. We present here a polynomial algorithm for finding a minimum f-dominating set in a block graph, where f-domination is an even more general concept as k-domination. This algorithm comprises previous known ones for trees or rather block …
-
Approximation algorithms for makespan minimization: restricted assignments, interval uncertainties, and price of connectivity
… relevant constraints. Through carefully designed algorithmic approaches, we improve upon existing approximation guarantees, derive new bounds for previously unexplored variants, and identify critical structural properties that deepen the understanding of the problem. In the first part of the …