MyJournals Home  

RSS FeedsAlgorithms, Vol. 15, Pages 36: Unranking Small Combinations of a Large Set in Co-Lexicographic Order (Algorithms)

 
 

25 january 2022 10:18:09

 
Algorithms, Vol. 15, Pages 36: Unranking Small Combinations of a Large Set in Co-Lexicographic Order (Algorithms)
 


The presented research is devoted to the problem of developing new combinatorial generation algorithms for combinations. In this paper, we develop a modification of Ruskey’s algorithm for unranking m-combinations of an n-set in co-lexicographic order. The proposed modification is based on the use of approximations to make a preliminary search for the values of the internal parameter k of this algorithm. In contrast to the original algorithm, the obtained algorithm can be effectively applied when n is large and m is small because the running time of this algorithm depends only on m. Furthermore, this algorithm can be effectively used when n and m are both large but n−m is small, since we can consider unranking (n−m)-combinations of an n-set. The conducted computational experiments confirm the effectiveness of the developed modification.


 
69 viewsCategory: Informatics
 
Algorithms, Vol. 15, Pages 34: Convex Neural Networks Based Reinforcement Learning for Load Frequency Control under Denial of Service Attacks (Algorithms)
Algorithms, Vol. 15, Pages 37: Optimal Integration of Dispersed Generation in Medium-Voltage Distribution Networks for Voltage Stability Enhancement (Algorithms)
 
 
blog comments powered by Disqus


MyJournals.org
The latest issues of all your favorite science journals on one page

Username:
Password:

Register | Retrieve

Search:

Informatics


Copyright © 2008 - 2022 Indigonet Services B.V.. Contact: Tim Hulsen. Read here our privacy notice.
Other websites of Indigonet Services B.V.: Nieuws Vacatures News Tweets Nachrichten