Bartosz Kamedulski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bartosz Kamedulski has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Piotr Bartłomiejczyk
Faculty of Applied Physics and Mathematics and BioTechMed Centre Gdańsk University of Technology Gdańsk Poland
3 shared publications - Piotr Nowak-Przygodzki
Sopot, Poland
3 shared publications - Agnieszka Blokus
Department of Modelling and Mathematical Methods in Transport, Faculty of Navigation, Gdynia Maritime University, 3 Jana Pawła II Av., 81-225 Gdynia, Poland
1 shared publication Marek Kubale
Faculty of Computer Science Gdynia Maritime University Gdynia Poland
1 shared publication- Piotr Michalak
Department of Mathematics, Faculty of Navigation, Gdynia Maritime University, 81-87 Morska St., 81-225 Gdynia, Poland
1 shared publication - Przemysław Dziula
Department of Navigation, Faculty of Navigation, Gdynia Maritime University, 3 Jana Pawła II Av., 81-225 Gdynia, Poland
1 shared publication
Latest Publications
Analysis of Greedy Algorithms for Chromatic Sum Coloring of a Graph
Sum coloring of a graph is a vertex coloring using positive integers (colors) that minimizes the total sum of the colors assigned to all vertices, where adjacent vertices must have different colors. The chromatic sum is the smallest total among all proper colorings of the graph . The need for considering such a graph coloring model follows from its application to solve problems of scheduling equal length tasks (e.g., university timetables). It stems from the fact that finding a minimum chromatic sum coloring corresponds to finding a schedule that minimizes the mean flow time and total completion time of tasks. Unfortunately, evaluating is NP‐hard. Therefore, we are forced to use polynomial‐time approximation algorithms. In this article, we analyze four of the most popular greedy graph coloring algorithms: , , and , standing for Largest First , Smallest Last , Saturation Largest First ( DSatur ) and Greedy Independent Sets , along with their improvements adapted to the needs of chromatic sum coloring. For any such algorithm, we give its description, the smallest , that is, hard‐to‐color (for which the algorithm always yields a sum greater than ) and , that is, slightly hard‐to‐color (where a total sum of colors greater than is possible under the worst‐case vertex ordering) graphs, as well as an estimation of its computational complexity and performance function. Finally, we show that a certain 8‐vertex graph is for the whole collection of algorithms under consideration.
Analysis of Greedy Algorithms for Chromatic Sum Coloring of a Graph
Sum coloring of a graph is a vertex coloring using positive integers (colors) that minimizes the total sum of the colors assigned to all vertices, where adjacent vertices must have different colors. The chromatic sum is the smallest total among all proper colorings of the graph . The need for considering such a graph coloring model follows from its application to solve problems of scheduling equal length tasks (e.g., university timetables). It stems from the fact that finding a minimum chromatic sum coloring corresponds to finding a schedule that minimizes the mean flow time and total completion time of tasks. Unfortunately, evaluating is NP‐hard. Therefore, we are forced to use polynomial‐time approximation algorithms. In this article, we analyze four of the most popular greedy graph coloring algorithms: , , and , standing for Largest First , Smallest Last , Saturation Largest First ( DSatur ) and Greedy Independent Sets , along with their improvements adapted to the needs of chromatic sum coloring. For any such algorithm, we give its description, the smallest , that is, hard‐to‐color (for which the algorithm always yields a sum greater than ) and , that is, slightly hard‐to‐color (where a total sum of colors greater than is possible under the worst‐case vertex ordering) graphs, as well as an estimation of its computational complexity and performance function. Finally, we show that a certain 8‐vertex graph is for the whole collection of algorithms under consideration.
- Open Access
Operation and Maintenance Cost of Water Management Systems: Analysis and Optimization
The analysis and optimization of the operational and maintenance costs of water management systems is one of the key issues of their exploitation. This article presents a general model, supported by specially designed software, able to process the analysis of exploitation costs of multistate renewable systems. The proposed model allows for the consideration of costs related to preventive inspections and repairs and additional reliability associated costs, such as costs of the system in a state of deteriorated reliability and financial losses related to reduced serviceability of the system or a lack of rendering of services. By means of a multistate approach to the reliability analysis, the model allows for the determination of the level corresponding to the appropriate reliability state that, if exceeded, should result in undertaking the repair of the system. In this study, the MATLAB 9.13 (R2022b) environment was used for simulation and estimation of the costs of system maintenance and repairs according to the proposed model. The article presents the results of the optimization of exploitation and repair costs of water management systems, allowing the estimation of the optimal period between regular inspections while maintaining the safe operation of the system. The model and software proposed can be of assistance in supporting the decision process of maintenance planning for water management systems.
Open AccessOperation and Maintenance Cost of Water Management Systems: Analysis and Optimization
The analysis and optimization of the operational and maintenance costs of water management systems is one of the key issues of their exploitation. This article presents a general model, supported by specially designed software, able to process the analysis of exploitation costs of multistate renewable systems. The proposed model allows for the consideration of costs related to preventive inspections and repairs and additional reliability associated costs, such as costs of the system in a state of deteriorated reliability and financial losses related to reduced serviceability of the system or a lack of rendering of services. By means of a multistate approach to the reliability analysis, the model allows for the determination of the level corresponding to the appropriate reliability state that, if exceeded, should result in undertaking the repair of the system. In this study, the MATLAB 9.13 (R2022b) environment was used for simulation and estimation of the costs of system maintenance and repairs according to the proposed model. The article presents the results of the optimization of exploitation and repair costs of water management systems, allowing the estimation of the optimal period between regular inspections while maintaining the safe operation of the system. The model and software proposed can be of assistance in supporting the decision process of maintenance planning for water management systems.
- 23 November 2020
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 52 (4) , 879-891
Product Property of Equivariant Degree Under the Action of a Compact Abelian Lie Group
- 23 November 2020
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 52 (4) , 879-891
Product Property of Equivariant Degree Under the Action of a Compact Abelian Lie Group
- 13 December 2019
- Published by Elsevier in Topology and its Applications
- Vol. 275, 107037
Topological degree for equivariant gradient perturbations of an unbounded self-adjoint operator in Hilbert space
- 13 December 2019
- Published by Elsevier in Topology and its Applications
- Vol. 275, 107037
Topological degree for equivariant gradient perturbations of an unbounded self-adjoint operator in Hilbert space
- Open Access
Topological degree for equivariant gradient perturbations of an unbounded self-adjoint operator in Hilbert space
We present a version of the equivariant gradient degree defined for equivariant gradient perturbations of an equivariant unbounded self-adjoint operator with purely discrete spectrum in Hilbert space. Two possible applications are discussed.
Open AccessTopological degree for equivariant gradient perturbations of an unbounded self-adjoint operator in Hilbert space
We present a version of the equivariant gradient degree defined for equivariant gradient perturbations of an equivariant unbounded self-adjoint operator with purely discrete spectrum in Hilbert space. Two possible applications are discussed.
- Open Access
Degree product formula in the case of a finite group action
Let $V, W$ be finite-dimensional orthogonal representations of a finite group $G$. The equivariant degree with values in the Burnside ring of $G$ has been studied extensively by many authors. We present a short proof of the degree product formula for local equivariant maps on $V$ and $W$.Open AccessDegree product formula in the case of a finite group action
Let $V, W$ be finite-dimensional orthogonal representations of a finite group $G$. The equivariant degree with values in the Burnside ring of $G$ has been studied extensively by many authors. We present a short proof of the degree product formula for local equivariant maps on $V$ and $W$.