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 176 for “"Approximation Algorithms"”.
-
Consensus-type stochastic approximation algorithms
… with asymptotic properties of consensus-type algorithms for networked systems whose topologies switch randomly. The regime-switching process is modeled as a discrete-time Markov chain with a nite state space. The consensus control is achieved by designing stochastic approximation algorithms. …
-
Approximation Algorithms for Geometric Networks
The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. A geometric network is, in its abstract form, a set of vertices, pairwise connected with an edge, such that …
-
Approximation algorithms for multi-facility location
… the development and implementation of efficient algorithms to obtain acceptable solutions for the location of several facilities to serve customer sites. The general version of facility location problem is known to be NP-hard; For locating multiple facilities we use Voronoi diagram of initial …
-
Approximation Algorithms using Allegories and Coq
In this thesis, we implement several approximation algorithms for solving optimization problems on graphs. The result computed by the algorithm may or may not be optimal. The approximation factor of an algorithm indicates how close the computed result is to an optimal solution. We are going to …
-
Approximation algorithms for resource allocation optimization.
… the thesis focuses on the design and analysis of approximation algorithms. The main techniques we adopt are linear programming based, such as primal-dual schema, linear program rounding, and reductions via linear programs. Our developed solutions have great potential for optimizing the …
-
Approximation algorithms for stochastic scheduling problems
… as a special case. We therefore seek to develop approximation algorithms: algorithms that run in polynomial time and compute a policy whose expected value is provably close to that of an optimal adaptive
-
Approximation algorithms for disjoint paths problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Approximation Algorithms for Network Design and Orienteering
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-07-16T16:48:21Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Korula_Nitish_Source.zip: 227797 bytes, checksum: 09732975f85c1988e787abe3e1a23600 (MD5) Korula_Nitish.pdf: 1461228 bytes, …
-
Approximation algorithms for grammar-based data compression
… is intractable, and so our objective is to find approximation algorithms. This simple question is connected to many areas of research. Most importantly, there is a link to data compression; instead of storing a long string, one can store a small grammar that generates it. A small grammar for a …
-
Approximation algorithms for combinatorial optimization under uncertainty
… network design and other areas. We develop approximation algorithms for several NP-hard stochastic combinatorial optimization problems in which the input is uncertain - modeled by probability distribution - and the goal is to design a solution in advance so as to minimize expected future …
-
Approximation algorithms for distributed and selfish agents
… own self interest. In this thesis, we develop approximation algorithms and decentralized mechanisms for various combinatorial optimization problems in such systems. First, we investigate the distributed caching and a general set of assignment problems. We develop an almost tight LP-based ... …
-
Approximation algorithms for packing and scheduling problems
In this thesis we consider three combinatorial optimization problems. Specifically, we study packing and scheduling questions of relevance in several areas of operations research, including interconnection networks and switch scheduling, VLSI design, and processor scheduling. The first chapter …
-
Approximation algorithms for submodular optimization and graph problems
… P =/= NP, there do not exist polynomial-time algorithms that always output an optimal solution. In order to cope with the intractability of these problems, we focus on algorithms that construct approximate solutions: An approximation algorithm is a polynomial-time algorithm that, for any …
-
Approximation algorithms for clustering and facility location problems
In this thesis we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P is not equal NP, there do not exist polynomial time algorithms to solve them optimally. One approach to cope with the intractability of …
-
Approximation algorithms for stochastic scheduling on unrelated machines
… presents the first nontrivial polynomial time approximation algorithms for an important class of machine scheduling problems. We study the family of preemptive minimum makespan scheduling problems where jobs have stochastic processing requirements and provide the first approximation algorithms …
-
Approximation algorithms for variants of the traveling salesman problem
… within any factor and thus there is no approximation algorithm for TSP for general graphs, unless P = NP. However, given the added constraint that edges of the graph observe triangle inequality, it has been shown that it is possible achieve a good approximation to the optimal solution …
-
On Algorithmic Progress in Data Structures and Approximation Algorithms
In the big data regime, computer systems and algorithms must process large amounts of data, making many traditional exact algorithms too costly to run. To work around this, researchers have developed approximation algorithms, which trade off some accuracy for asymptotic improvements in runtime, and …
-
Approximation algorithms for multicommodity flow and shop scheduling problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.
-
Improved Approximation Algorithms for Geometric Packing Problems With Experimental Evaluation
… design. In this thesis, we present two novel algorithms using dynamic programming to compute exactly the maximum number of k x k squares of unit size that can be packed without overlap into a given n x m grid. The first algorithm was implemented and ran successfully on problems of large input …
-
Interactive proof system variants and approximation algorithms for optical networks
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Page 1 of 9