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 20 for “"Set cover"”.
-
Geometric set cover and related geometric optimization problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms
-
Sub-linear algorithms for graph problems
In the face of massive data sets, classical algorithmic models, where the algorithm reads the entire input, performs a full computation, then reports the entire output, are rendered infeasible. To handle these data sets, alternative algorithmic models are suggested to solve problems under the …
-
A pseudo-polynomial time O(log² n)-approximation algorithm for art gallery problems
… positions so that guards located at these points cover the interior of the art gallery. Our algorithm is pseudo-polynomial in the sense that it is polynomial in the number of walls of the art gallery but is possibly exponential in the number of bits required to represent the positions of the …
-
Design analytics for product family optimization
… I propose a new method that finds a finite subset of the solution space. The method formulates the problem as optimization problems and utilizes a derivative-free method. With the design sample that is collected from the solution space, a mixed integer linear programs are built and solved …
-
Sublinear algorithms for massive data problems
… problems in the models that address massive data sets. The models include streaming algorithms, sublinear time algorithms, property testing algorithms, sublinear query time algorithms with preprocessing, or computing small summaries for large data. More precisely, we study the following problems. …
-
Combinatorial Optimization On Massive Datasets: Streaming, Distributed, And Massively Parallel Computation
With the emergence of massive datasets across different application domains, there is a rapidly growing need to solve various optimization tasks over such datasets. This in turn raises the following fundamental question: How well can we solve a large-scale optimization problem on massive datasets …
-
New directions in streaming algorithms
… (essentially) optimal streaming algorithms for set cover and maximum coverage, two classic problems in combinatorial optimization. Next, in the second part, we will show how to augment classic streaming algorithms of the frequency estimation and low-rank approximation problems with machine …
-
Combinatorial aspects of low-rank matrix factorization and two applications in bioinformatics
… Finally, the concepts of surplus and submodular set functions appear at different points of the discussion. After the definition of identifiable graphs, we focus on two optimization problems that arise in the context of source-sensor networks. For these problems we coin the names MINSENSOR and …
-
Energy-Constrained UAV-UGV Cooperative Systems: A Bilevel Framework for Routing in Multi-Agent Teams
… recharging stops are determined using a minimum set cover formulation, guiding the UGV’s road-constrained routing, modeled as a Traveling Salesman Problem. At the lower level, UAV task allocation is solved using an Energy-Constrained Vehicle Routing Problem with Time Windows (E-VRPTW). The …
-
Discovering Conserved cis-Regulatory Elements That Regulate Expression in Caenorhabditis elegans
… This initial first step was valuable as it recovered some known elements and cis-regulatory modules. Yet the results had a lot of redundant motifs and sites, and the approach was not efficiently scalable to the entire regulome of <italic>C. elegans</italic> or other higher-order eukaryotes. …
-
Index design for information retrieval applications using database concepts
… with provable guarantees for a weighted set cover based relaxation of the original problem. This is then combined with an overarching branch-and-bound based optimality preserving state-space search algorithm that efficiently prunes the state-space by using the above heuristic algorithm. …
-
Scheduling to minimize power consumption using submodular functions
… where n is the number of jobs. (Even in a simple setting with one processor, the problem is Set-Cover hard.) If not all jobs can be scheduled and each job has a specified value, then our algorithm finds a schedule of value at least (1 - c)Z and power usage within an O(log(1/E)) factor of the …
-
Constant time algorithms in sparse graph model
… algorithms for problems such as Vertex Cover, Maximum Matching, Maximum Weighted Matching, Maximum Independent Set and Set Cover. Some of our techniques can also be applied to design constant-time testers for minor-closed properties. In Chapter 1, we show how to construct a simple oracle …
-
Automatic tool path generation for multi-axis machining
… perform a visibility analysis from a discrete set of orientations arranged on the Gaussian Sphere. This analysis is performed in object space to ensure reliability. For each triangle, a discrete set approximation of the accessibility cone is then constructed. Next, a minimum set cover algorithm …
-
Algorithms for discovering disease genes by integrating 'omics data
… (PPI), provide a useful resource for uncovering the disease association of multiple molecules in the context of their biological function and interactions. In this thesis, we develop algorithms that integrate different -omic data types to provide systems-level insights into complex …
-
Probabilistic formulations of some facility location problems
The area of facilities location covers a wide variety of problems involving both public and private sector applications. To date, the study of location problems has been restricted primarily to deterministic formulations of the problem. The present research effort investigates the effect of random …
-
Exploring the Landscape of Big Data Analytics Through Domain-Aware Algorithm Design
… mutations responsible for cancers to weighted set cover (WSC) problem by leveraging the semantics of cancer genomic data obtained from cancer biology. Solving the mapped WSC with an approximate algorithm, we identified a set of multi-hit combinations that differentiate between tumor and normal …
-
Reliable design of interdependent service facility systems under correlated disruption risks
… patterns and varying network and parameter settings. We then apply the reliable location modeling framework to sensor deployment problems, where multiple sensors work in combinations to provide combinatorial coverage service to customers via trilateration procedure. Since various sensor …
-
Detection and Localization of Pressure Transients in Water Distribution Systems
… and branched) and pipe characteristics, we discover that multiple shortest paths (MSP; where pressure waves from different paths arrive almost simultaneously at the sensor) amplify the signal due to transient interference phenomenon and enhance the detectability of transients. This effect is …