9 citations · 11 across the 3 of their papers we have counts for
5 papers
Experiments with graph convolutional networks for solving the vertex -center problem
Elisabeth Gaar, Markus Sinnl
In the last few years, graph convolutional networks (GCN) have become a popular research direction in the machine learning community to tackle NP-hard combinatorial optimization pr…
A Computational Study of Exact Subgraph Based SDP Bounds for Max-Cut, Stable Set and Coloring
Elisabeth Gaar, Franz Rendl
The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization…
Improving ADMMs for Solving Doubly Nonnegative Programs through Dual Factorization
Martina Cerulli, Marianna De Santis, Elisabeth Gaar +1
Alternating direction methods of multipliers (ADMMs) are popular approaches to handle large scale semidefinite programs that gained attention during the past decade. In this paper,…
A Bundle Approach for SDPs with Exact Subgraph Constraints
Elisabeth Gaar, Franz Rendl
The 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization…
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formula…