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 26 for “"Polynomial-Time Approximation Algorithm"”.
-
Information-theoretic multi-robot path planning
… to improve the sampling performance and time efficiency of planning for anisotropic fields. In this thesis, we cast the planning problem into a stagewise decision-theoretic problem. we adopt Gaussian Process to model spatial phenomena. Maximum entropy criterion and maximum mutual …
-
Computational Complexity Of Bi-clustering
… and complement this result by introducing a polynomial time approximation algorithm for this bi-clustering task. This is the first positive approximation guarantee for bi-clustering algorithms. We also show that bi-clustering with our objective function can be viewed as a generalization of …
-
An Algorithm for Stable Matching with Approximation up to the Integrality Gap
… attain that of 4/3 − ε (≈ 1.3333). We present a polynomial-time approximation algorithm with a performance guarantee of (3L − 2)/(2L − 1) where L is the maximum tie length. Our result matches the known lower bound on the integrality gap for the associated LP formulation.
-
EFFICIENT GEOMETRIC ALGORITHMS FOR STOCHASTIC AND CATEGORICAL DATA
Modern algorithmic frameworks must contend with data that is both massive and inherently uncertain. This dissertation explores efficient geometric algorithms for handling such data across two regimes: temporal evolution and spatial classification. In the first part, we address "temporal …
-
Interference in wireless mobile networks
… in two or more dimensions (Buchin 2008) and no polynomial-time approximation algorithm is known. We show how to solve the problem efficiently in settings typical for wireless ad hoc networks. We show that if node positions are represented by a set P of n points selected uniformly and …
-
Safe, Scalable, and Complete Motion Planning of Large Teams of Interchangeable Robots
… of novel, complete, computationally tractable algorithms to control a team of robots and avoid collisions while retaining a notion of optimality. This dissertation begins by presenting a robust decentralized formation control algorithm for control of robots operating in tight proximity to one …
-
Algorithms for Integer Programming and Allocation
The first part of the thesis contains pseudo-polynomial algorithms for integer linear programs (ILP). When certain parameters of an ILP are fixed, that is, they are treated as constants in the running time, it is possible to obtain algorithms with a running time that is pseudo-polynomial in the …
-
Generalizations, Extensions, and Applications of the Sequential Knapsack Problem
… smallest to largest. We present an O(n^2 log n) algorithm that solves SKP and the Bounded Sequential Knapsack Problem (B-SKP) exactly, by exploiting the divisibility property of the constraint. We then adapt this algorithm to provide an approximate solution for the more general Consecutive …
-
Approximation, Proof Systems, and Correlations in a Quantum World
… classes. In the classical setting, the study of approximation algorithms and hardness of approximation is one of the main research areas of theoretical computer science. Yet, little is known regarding approximability in the quantum setting. We first demonstrate a polynomial-time approximation …
-
Decision making under uncertainty
… functions. We present novel exact or approximate algorithms for efficiently ranking large datasets according to these ranking functions, even if the datasets exhibit complex correlations or the probability distributions are continuous. The second problem concerns with the stochastic versions of a …
-
Efficient Algorithms for Coordinated Motion in Shared Spaces
… systems motivates a number of interesting algorithmic problems. These systems, such as self-driving cars, must contend with far more complex and dynamic environments than factory floor robots of the past. This dissertation seeks to identify optimization problems that are simple enough to …
-
Matchings and Flows in Hypergraphs
… generalizing bipartite graphs. First, we give a polynomial time approximation algorithm for the maximum weight matching problem on so-called partitioned hypergraphs, whose approximation factor is best possible up to a constant. Afterwards, we look at the theorems of König and Hall and their …
-
Optimization algorithm design and performance analysis for next-generation wireless networks
… deals with the design of efficient optimization algorithms for next-generation wireless networks, including terrestrial as well as satellite communication systems. More specifically, the theory of sequential convex optimization (SCO) is applied to solve challenging optimization problems, such as …
-
A structural approach to matching problems with preferences
… or all of the agents. We present a number of new algorithmic results for five specific problem domains. Each of these results is derived with the aid of some structural properties implicitly embedded in the problem. We begin by describing an approximation algorithm for the problem of finding a …
-
Σχεδόν βέλτιστοι αλγόριθμοι και αποτελέσματα μη-προσέγγισης για προβλήματα κάλυψης πολυγωνικών περιοχών
… and studied, regarding its combinatorial and algorithmic aspects. A reasonable variation is to try to cover as many points as possible using a given number of stations. This variation takes into account that a given budget might not suffice for the total covering of the geographical region. …
-
Approximation algorithms for multidimensional bin packing
… bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical bin packing problem, we are given a list of real numbers in the range (0, 1], the goal is to place them in a minimum number of bins so that …
-
RESOURCE MANAGEMENT FOR MOBILE COMPUTATION OFFLOADING
… remote task execution, so that task completion time constraints are satisfied. The objective is to minimize the average power consumption of the MDs, subject to a cost budget constraint on communication and computation resources. The thesis includes contributions for both soft and hard task …
-
Προσεγγιστικοί αλγόριθμοι για δρομολόγηση πακέτων μηνυμάτων σε δίκτυα με κόστος επανεκκίνησης
… applications as far as Optical Networks, TDMA (Time Division Multiple Access) and parallel message or data transmission are concerned. For the purposes of this manuscript the graph theoretic model of the problem is used. Researchers are referring to the problem at hand as PREEMPTIVE BIPARTITE …
-
View Selection for Large Scale 3D Reconstruction
… indoor cleaning to transportation. Systems and algorithms are being developed at a rapid pace to capture the markets driving these applications. Capturing data to visualize and understand the operating environments in these applications is crucial. Whether it is to capture a High-Definition (HD) …
-
Environmental Monitoring with Unmanned Aerial Vehicles
… and accuracy. Data collection is important for algorithms and systems that try to learn how the physical world works or try to interact with it. The number, variety and quality of the data directly affects the performance of these algorithms. In order to fully realize this vision we need to …
Page 1 of 2