Totally Greedy Coin Sets and Greedy Obstructions
نویسندگان
چکیده
منابع مشابه
Totally Greedy Coin Sets and Greedy Obstructions
A coin set is a strictly increasing list of positive integers that always begins with 1. A coin set is called greedy when the simple greedy change-making algorithm always produces the fewest number of coins in change. Here, the greedy changemaking algorithm repeatedly selects the largest denomination coin less than the remaining amount until it has assembled the correct change. Pearson has prov...
متن کاملGreedy defining sets of graphs
For a graph G and an order a on V(G), we define a greedy defining set as a subset S of V(G) with an assignment of colors to vertices in S, such that the pre-coloring can be extended to a x( G)-coloring of G by the greedy coloring of (G, a). A greedy defining set ofaX( G)-coloring C of G is a greedy defining set, which results in the coloring C (by the greedy procedure). We denote the size of a ...
متن کاملGreedy decomposition integrals
In this contribution we define a new class of non-linear integrals based on decomposition integrals. These integrals are motivated by greediness of many real-life situations. Another view on this new class of integrals is that it is a generalization of both the Shilkret and PAN integrals. Moreover, it can be seen as an iterated Shilkret integral. Also, an example in time-series analysis is prov...
متن کاملMore results on greedy defining sets
The greedy defining sets of graphs were appeared first time in [M. Zaker, Greedy defining sets of graphs, Australas. J. Combin, 2001]. We show that to determine the greedy defining number of bipartite graphs is an NP-complete problem. This result answers affirmatively the problem mentioned in the previous paper. It is also shown that this number for forests can be determined in polynomial time....
متن کاملMore greedy defining sets in Latin squares
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 Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/814