42 citations · 144 across the 30 of their papers we have counts for
4 papers · 1 filter
Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs
Hao Hu, Renata Sotirov, Henry Wolkowicz
We consider both facial reduction, \FRp, and symmetry reduction, \SRp, techniques for semidefinite programming, \SDPp. We show that the two together fit surprisingly well in an alt…
Lower Bounds for the Bandwidth Problem
Franz Rendl, Renata Sotirov, Christian Truden
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the…
The Quadratic Cycle Cover Problem: special cases and efficient bounds
Frank de Meijer, Renata Sotirov
The quadratic cycle cover problem is the problem of finding a set of node-disjoint cycles visiting all the nodes such that the total sum of interaction costs between consecutive ar…
On solving the densest -subgraph problem on large graphs
Renata Sotirov
The densest -subgraph problem is the problem of finding a -vertex subgraph of a graph with the maximum number of edges. In order to solve large instances of the densest -s…