1 - 3 / 3 ![]() ![]() ![]() ![]() |
1. On the Embed and Project Algorithm for the graph bandwidth problem Janez Povh, 2021, izvirni znanstveni članek Ključne besede: graph bandwidth problem, semidefinite programming, combinatorial optimization, Embed and Project Algorithm, approximation algorithm |
2. Online algorithms for graph partitioning into cliques Aleksander Fabijan, 2014, diplomsko delo Ključne besede: competitive analysis, clustering, online algorithm, approximation algorithm, computer science, diploma |
3. Optimal uniform approximation by planar parametric polynomials Aleš Vavpetič, Emil Žagar, 2024, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: uniform approximation, Remez algorithm, planar parametric curves |