The CORDIC algorithm is a well-known iterative method for the computation of vector rotation. For applications that require forward rotation (or vector rotation) only, the Extended Elementary Angle Set (EEAS) Scheme provides a relaxed approach to speed up the operation of the CORDIC algorithm. When determining the parameters of EEAS-based CORDIC algorithm, two optimization problems are encounte...

We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the partial characterizations of Rado, Gale, and Edmonds (matroids), and of Korte and Lovasz (greedoids). We show that the greedy algorithm optimizes all linear objective functions if and only if the problem structure (phrase...

A Greedy Defining Set is a set of entries in a Latin Square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succeeds. Let g(n) be the smallest defining set for any Latin Square of order n. We give theorems on the upper bounds of gn and a table listing upper bounds of gn for small values of n. For a circulant Latin square, we find ...

The aim of this work is to continue with the ideas in Flores et al. [3] including the proposed greedy algorithm in order to develop them. When cash becomes available in a company, there are several strategies that allow us to benefit from it. The problem is how much to invest, for how long, and using which of the investment options in order to get the maximum profit out of it. A common problem ...

In many real-world situations, different and often opposite opinions, innovations, or products are competing with one another for their social influence in a networked society. In this paper, we study competitive influence propagation in social networks under the competitive linear threshold (CLT) model, an extension to the classic linear threshold model. Under the CLT model, we focus on the pr...

The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical li...

Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class of convex optimization problems. We derive a bound on the rate of approximation for this algorithm, and show that our algorithm includes a number of earlier studies as special cases.

Many known efficient algorithms for computational problems can be classified into a few algorithm paradigms: greedy algorithms, divide-and-conquer, dynamic programming, linear programming and backtracking algorithms. An approach to evaluating different algorithm paradigms is to show approximability of a specific computational problem in each paradigm. A ncessary component of such evaluation is ...

We give a simple, randomized greedy algorithm for the maximum satisfiability problem (MAX SAT) that obtains a 3 4 -approximation in expectation. In contrast to previously known 3 4 -approximation algorithms, our algorithm does not use flows or linear programming. Hence we provide a positive answer to a question posed by Williamson in 1998 on whether such an algorithm exists. Moreover, we show t...

Given a positive integer k and a complete graph with non-negative edge weights that satisfy the triangle inequality, the remote-clique problem is to find a subset of k vertices having a maximum-weight induced subgraph. A greedy algorithm for the problem has been shown to have an approximation ratio of 4, but this analysis was not shown to be tight. In this thesis, we present an algorithm called...