University Teaching Load Distribution Algorithm

Vladlena D. Markvirer; Ekaterina A. Karnaukhova

doi:10.1109/ITQMTIS58985.2023.10346285

Publications

?

University Teaching Load Distribution Algorithm

P. 152–155.

Vladlena D. Markvirer, Ekaterina A. Karnaukhova

This article presents an overview of the main algorithms used in resource distribution problems. The description, input and output data, as well as peculiarities and complexity of these algorithms are considered. The paper proposes a modified algorithm for finding vapor combinations in a graph, which allows solving the problem of optimal load distribution between the teachers of a structural subdivision of the university and the disciplines that this subdivision is obliged to implement in an academic year. The need for modification of the algorithm is argued by the unevenness and variability of the subject area, multi-criteria load assignment and the need to take into account subjective characteristics of the decision on allocation.

Keywords: graph algorithms teaching load distribution graph algorithms application

In book

023 International Conference on Quality Management, Transport and Information Security, Information Technologies (IT&QM&IS)

Petrozavodsk: IEEE, 2023.

How to Guide a Present-Biased Agent Through Prescribed Tasks?

Belova T., Dementiev Y., Fomin F. et al., , in: 27th European Conference on Artificial Intelligence, 19–24 October 2024, Santiago de Compostela, Spain – Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024)Vol. 392.: IOS Press, 2024. P. 3461–3468.

Added: October 24, 2024

Optimal monomial quadratization for ODE systems: extended abstract

Bychkov A., Pogudin G., ACM Communications in Computer Algebra 2021 Vol. 54 No. 3 P. 119–123

Transformation of a polynomial ODE system to a special quadratic form has been successfully used recently as a preprocessing step for model order reduction methods. However, to the best of our knowledge, there has been no practical algorithm for performing this step automatically with any optimality guarantees. We present an algorithm that, given a system of ...

Added: October 19, 2021

Computer Science – Theory and Applications 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings

Springer, 2020.

This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including ...

Added: September 4, 2020

Fundamentals of Computation Theory, 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings

Springer, 2019.

Added: August 4, 2019

Combinatorial Algorithms. 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018. Lecture Notes in Computer Science

Springer, 2018.

This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, ...

Added: October 23, 2018

Faster algorithms for half-integral T -Path packing

Babenko M. A., Artamonov S., , in: 28th International Symposium on Algorithms and Computation, ISAAC 2017Vol. 92.: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2017. P. 1–12.

Let G = (V,E) be an undirected graph, T ⊆ V be a set of terminals. Then a natural combinatorial problem consists in finding the maximum number of vertex-disjoint paths connecting distinct terminals. For this problem, a clever construction suggested by Gallai reduces it to computing a maximum non-bipartite matching and thus gives an O ( m ...

Added: March 1, 2018

Хранение и обработка графа социальных сетей

Polyakov I. V., Chepovskiy A., Chepovskiy A., Вестник Новосибирского государственного университета. Серия: Информационные технологии 2013 Т. 11 № 4 С. 77–83

In this paper special data structure for big social graph storing and operating is presented. We discuss mainly graph paths searching, obtaining subgrapths and addition of new edges and vertices. ...

Added: October 17, 2013

Term Weighting in Expert Search Task: Analyzing Communication Patterns?

Dmitry Romanov, Kravchenko A., , in: Concept Discovery in Unstructured Data. 2nd International Workshop, CDUD 2012, Leuven, Belgium, May 2012, ProceedingsIssue 871.: Leuven: Katholieke Universiteit Leuven, 2012. Ch. 5 P. 40–48.

The goal of the expert search task is nding knowledgeable persons within the enterprise. In this paper we focus on its distinctions from the other information retrieval tasks. We review the existing approaches and propose a new term weighting scheme which is based on analysis of communication patterns between people. The eectiveness of the proposed ...

Added: March 20, 2013

Min-Cost Multiflows in Node-Capacitated Undirected Networks

Babenko M. A., Karzanov A. V., Journal of Combinatorial Optimization 2012 Vol. 24 No. 3 P. 202–228

We consider an undirected graph $G = (VG, EG)$ with a set $T \subseteq VG$ of terminals, and with nonnegative integer capacities $c(v)$ and costs $a(v)$ of nodes $v\in VG$. A path in $G$ is a \emph{$T$-path} if its ends are distinct terminals. By a \emph{multiflow} we mean a function $F$ assigning to each $T$-path ...

Added: January 27, 2013

Improved Algorithms for Even Factors and Square-Free Simple b-Matchings

Babenko M. A., Algorithmica 2012 Vol. 64 No. 3 P. 362–383

Given a digraph $G = (VG,AG)$, an even factor $M \subseteq AG$ is a set formed by node-disjoint paths and even cycles. Even factors in digraphs were introduced by Geelen and Cunningham and generalize path matchings in undirected graphs. Finding an even factor of maximum cardinality in a general digraph is known to be NP-hard ...

Added: January 27, 2013