3 citations · 5 across the 4 of their papers we have counts for
5 papers
Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem
Alexander Veremyev, Mikhail Goubko
Several novel mixed-integer linear and bilinear formulations are proposed for the optimum communication spanning tree problem. They implement the distance-based approach: graph dis…
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
Mikhail Goubko, Alexander Veremyev
It is known from the algebraic graph theory that if is the Laplacian matrix of some tree with a vertex degree sequence and is its dist…
Dense Subgraphs in Random Graphs
Paul Balister, Béla Bollobás, Julian Sahasrabudhe +1
For a constant and a graph , let be the largest integer for which there exists a -vertex subgraph of with at least edges. We show…
The Minimum Edge Compact Spanner Network Design Problem
Tathagata Mukherjee, Alexander Veremyev, Piyush Kumar +1
In this paper we introduce and study the Minimum Edge Compact Spanner~(MECS) problem. We prove hardness results related to the problem, design exact and greedy algorithms for solvi…
On the hierarchical risk-averse control problems for diffusion processes
Getachew K. Befekadu, Alexander Veremyev, Eduardo L. Pasiliao
In this paper, we consider a risk-averse control problem for diffusion processes, in which there is a partition of the admissible control strategy into two decision-making groups (…