Zobrazeno 1 - 10
of 234
pro vyhledávání: '"Povh, Janez"'
Given an undirected graph, the stable set problem asks to determine the cardinality of the largest subset of pairwise non-adjacent vertices. This value is called the stability number of the graph, and its computation is an NP-hard problem. In this pa
Externí odkaz:
http://arxiv.org/abs/2405.12845
Autor:
Povh, Janez, Pucher, Dunja
We assess the performance of D-wave quantum solvers for solving the stable set problem in a graph, one of the most studied NP-hard problems. We perform computations on some instances from the literature with up to 125 vertices and compare the quality
Externí odkaz:
http://arxiv.org/abs/2308.13041
The clustering of data is one of the most important and challenging topics in data science. The minimum sum-of-squares clustering (MSSC) problem asks to cluster the data points into $k$ clusters such that the sum of squared distances between the data
Externí odkaz:
http://arxiv.org/abs/2305.13218
Autor:
Jones, Christopher R., Oltra, Christian, Giacometti, Alessio, Čok, Vanja, Povh, Janez, Lamut, Ursa, Meskens, Gaston, Kenens, Joke, Geysmans, Robbe, Turcanu, Catrinel, Ferencz, Zoltan, Orlando, Maria Teresa, Bustreo, Chiara
Publikováno v:
In Energy Research & Social Science July 2024 113
Autor:
Hribar, Rok, Hrga, Timotej, Papa, Gregor, Petelin, Gašper, Povh, Janez, Pržulj, Nataša, Vukašinović, Vida
In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simultaneously. This can be considered as a generalization of the classical
Externí odkaz:
http://arxiv.org/abs/2012.05963
Autor:
Hrga, Timotej, Povh, Janez
We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound paradigm that applies alternating direction method of multipliers as the
Externí odkaz:
http://arxiv.org/abs/2010.07839
Autor:
Gusmeroli, Nicolò, Hrga, Timotej, Lužar, Borut, Povh, Janez, Siebenhofer, Melanie, Wiegele, Angelika
We present BiqBin, an exact solver for linearly constrained binary quadratic problems. Our approach is based on an exact penalty method to first efficiently transform the original problem into an instance of Max-Cut, and then to solve the Max-Cut pro
Externí odkaz:
http://arxiv.org/abs/2009.06240
Autor:
Asadi, Soodabeh, Povh, Janez
This article utilizes the projected gradient method (PG) for a non-negative matrix factorization problem (NMF), where one or both matrix factors must have orthonormal columns or rows. We penalise the orthonormality constraints and apply the PG method
Externí odkaz:
http://arxiv.org/abs/2003.10269
Publikováno v:
Chaos 30, 033128 (2020)
We show how to couple phase-oscillators on a graph so that collective dynamics "searches" for the coloring of that graph as it relaxes toward the dynamical equilibrium. This translates a combinatorial optimization problem (graph coloring) into a func
Externí odkaz:
http://arxiv.org/abs/1909.06095
Publikováno v:
Math. Program. 193 (2022) 789-829
This article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data. A converging hierarchy of semidefinite relaxations for eigenvalue and trace optimization is provided. This hierarchy
Externí odkaz:
http://arxiv.org/abs/1909.00569