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 20 of 152 for “"Polynomial time algorithms"”.
-
Polynomial Time Algorithms for Transportation and Inventory Management in Serial Supply Chain with Multi-Module Capacitated Vehicles
… in which the total capacity available in each time period is the sum of capacities of a subset of n heterogeneous modules (machines or vehicles). We refer to this class of problems as the Multi-module Capacitated Lot-Sizing Problem without and with Subcontracting, denoted by MCLS and MCLS-S, …
-
Χαρακτηρισμός νέων κλάσεων τέλειων γραφημάτων και αγλόριθμοι χρωματισμού και μέγιστων διαδρομών
… colinear and linear graphs. Moreover, we present polynomial-time algorithms or NP-completeness results for various types of the coloring problem on graphs and polynomial-time algorithms for the longest path problem on perfect graphs. In particular, motivated by the de nition of linear coloring on …
-
Scheduling Fork-Join Structures in Parallel Systems
… theory. These results include an Efficient Polynomial Time Approximation Scheme (EPTAS) for scheduling to homogeneous systems, as well as more practical approximations and polynomial time algorithms for further sub-cases. In addition to classifying the problem in regards to approximability, …
-
On the Learnability of Disjunctive Normal Form Formulas and Decision Trees
… formulas and decision trees is investigated. Polynomial time algorithms are given, and nonlearnability results are obtained, for restricted versions of these general learning problems.
-
On the independent spanning tree conjectures and related problems
… similar to an ear decomposition, and give polynomial-time algorithms to construct the decomposition and the trees. We provide alternate geometric proofs for the cases k = 3 of both the Independent Spanning Tree Conjecture and Edge-Independent Spanning Tree Conjecture by embedding the …
-
Energy-efficient broadcast and multicast algorithms in wireless ad hoc networks
… problem and the BLM/MLM (Broadcast/Multicast Lifetime Maximization) problem. For the first class of problem, we have developed a general analytical MILP (Mixed Integer Linear Programming) model for the MPM problem in an ad hoc network with adaptive antennas, and also implemented a group of …
-
Edge-packing by isomorphic subgraphs
… graphs, planar graphs and trees). We give polynomial-time algorithms when G is a 2-path or when H is a tree; we show the problem is NP-complete otherwise. Also, we propose straightforward greedy polynomial-time approximation algorithms which are at least 1/|E<sub>G</sub>| optimal.
-
An Alternative Approach to Counting Minimum (s; t)-cuts in Planar Graphs
… networks. Researchers have previously developed polynomial-time algorithms to count minimum cuts in planar graphs which utilize the relationship between maximum network flows and minimum cuts. This thesis presents a polynomial-time algorithm to count the number of minimum (s,t)-cuts in a planar …
-
Topics in Graph Algorithms: Structural Results and Algorithmic Techniques, with Applications
… main challenge has usually been the design of polynomial time algorithms for NP-complete problems in a way that guarantees some, often worst-case, satisfactory performance when compared to exact (optimal) solutions. We mainly study some emergent techniques that help to bridge the gap between …
-
Tensor rank decompositions via the pseudo-moment method
… of pseudo-moments" is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those …
-
Recognizing Even-Cycle and Even-Cut Matroids
… graphic and cographic matroids. We give algorithms to check membership for these classes of matroids. We assume that the matroids are 3-connected and are given by their (0,1)-matrix representations. We first give an algorithm to check membership for p-cographic matroids that is a subclass …
-
Prime And Irreducible Elements In Z<sub>x</sub> , Hamiltonian Cycles In Concentric Circle Graphs, And Fibonacci Sequences In Z<sub>x</sub>
… theory of concentric circle graphs and present polynomial time algorithms for determining Hamiltonian cycles in certain types of concentric circle graphs. In the third part, we discuss the Fibonacci sequence in Zx. All of the theorems stated in our thesis are new to us.
-
Systematic parameterized complexity analysis in computational phonology
… and hence probably do not have fast, i.e., polynomial time, algorithms. Such problems may yet have non-polynomial time algorithms, and the non-polynomial time complexities of these algorithm will be functions of particular aspects of that problem, i.e., the algorithm's running time is upper …
-
Προσεγγιστικά σχήματα, κλίκες, χρώματα και πυκνότεροι υπογράφοι
… of a given graph G = (V, E). We present algorithms of polynomial time as well as approximation results on special graph classes. Analytically, in the thesis we study polynomial time algorithms for the densest k-subgraph problem on weighted graphs of maximal degree two, on weighted trees …
-
Efficient Computation of Chromatic and Flow Polynomials
This thesis surveys chromatic and flow polynomials, and presents new efficient methods to compute these polynomials on specific families of graphs. The chromatic and flow polynomials of a graph count the number of ways to color and assign flow to the graph; they also contain other important …
-
Maximality and Applications of Subword-Closed Languages
… of deterministic finite automata and lead to polynomial time algorithms for generating such languages. We prove that the subword closure S⊗ is strictly locally testable. Finally, we discuss applications to coding theory and encoding arbitrary blocks of information on DNA strands. This leads to …
-
Symmetry detection and approximation
In this thesis, we will present algorithms to solve the following two closely related problems: The first problem we will consider is to detect the symmetry group of a two-dimensional object even in the case where its representation is distorted by noise. We will derive and analyze algorithms …
-
Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines
… A job j scheduled on machine i takes p_{i,j} time units to complete, where 1 ≤ i ≤ m and 1 ≤ j ≤ n. For a given schedule, the makespan is the completion time of a machine that finishes last. The goal is to produce a schedule of all n jobs with minimum makespan. This is known as the makespan …
-
Minimizing the maximum Interference in k-connected wireless networks
… respectively. In the symmetric case, we present polynomial-time algorithms that build a k-connected network on any given set of n nodes with interference O(sqrt(kn)) in one dimension and O(min{k sqrt(n), k log lambda}) in two dimensions, where lambda denotes the ratio of the longest to shortest …
Page 1 of 8