EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Indexed Subset Construction: A Structured Algorithmic Framework

Bakhtgerey Sinchev, Askar Sinchev, Aksulu Mukhanova, Tolkynai Sadykova, Anel Auyezova, Kuanysh Baimirov

Algorithms · 15.05.2026 · 19 (5) · 397

DOI: 10.3390/a19050397 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 15.05.2026. Verfasst von Bakhtgerey Sinchev und 5 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Science and Higher Education of the Republic of Kazakhstan.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper studies subset construction in NP-complete problems from the perspective of structured exploration of combinatorial search spaces. Classical approaches rely on exhaustive enumeration of subsets, which leads to exponential growth in time and memory requirements. To address this limitation, we introduce an indexed framework based on the correspondence between a finite set and its associated index set. Within this framework, subsets are represented as ordered index sequences, allowing subset construction to be reformulated as a constraint-guided search process over index space. Candidate subsets are characterized by numerical descriptors derived from their indices (referred to as index certificates), which guide and filter the construction process. Subset generation is further organized through admissible index intervals that restrict feasible transitions and reduce the effective search space. The framework is based on an index-based representation and structured traversal of pairwise index combinations. Computational experiments on representative instances illustrate the behavior of the indexed construction procedure and indicate its efficiency relative to classical enumeration-based methods for small and medium-sized instances. The proposed approach provides a structured perspective on combinatorial search and offers a basis for further development of algorithms based on constrained exploration of subset structures.

Förderung

  • Ministry of Science and Higher Education of the Republic of Kazakhstan

Zitieren

APA

Sinchev, B., Sinchev, A., Mukhanova, A., Sadykova, T., Auyezova, A., & Baimirov, K. (2026). Indexed Subset Construction: A Structured Algorithmic Framework. Algorithms, 19(5), 397. https://doi.org/10.3390/a19050397

Vancouver

Sinchev B, Sinchev A, Mukhanova A, Sadykova T, Auyezova A, Baimirov K. Indexed Subset Construction: A Structured Algorithmic Framework. Algorithms. 2026;19(5):397. doi:10.3390/a19050397

BibTeX
@article{Sinchev2026,
  author = {Sinchev, Bakhtgerey and Sinchev, Askar and Mukhanova, Aksulu and Sadykova, Tolkynai and Auyezova, Anel and Baimirov, Kuanysh},
  title = {Indexed Subset Construction: A Structured Algorithmic Framework},
  journal = {Algorithms},
  year = {2026},
  volume = {19},
  number = {5},
  pages = {397},
  doi = {10.3390/a19050397}
}
Kostenlos starten →