Alexander Veremyev

activity

20172021

most citedThe Minimum Edge Compact Spanner Network Design Problem

2 citations · 2 across the 2 of their papers we have counts for

collaborators

4 papers

math.OC2021

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…

math.CO2020

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 $L$ is the Laplacian matrix of some tree $G$ with a vertex degree sequence $d = (d_{1}, ..., d_{n})^{⊤}$ and $D$ is its dist…

math.CO2018

Dense Subgraphs in Random Graphs

Paul Balister, Béla Bollobás, Julian Sahasrabudhe +1

For a constant $γ \in [0, 1]$ and a graph $G$ , let $ω_{γ} (G)$ be the largest integer $k$ for which there exists a $k$ -vertex subgraph of $G$ with at least $γ (2 k)$ edges. We show…

cs.DM2017★ 2 cited

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…