8 research outputs found
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)
AMS classification: 90C22, 20Cxx, 70-08
Application of semidefinite programming to maximize the spectral gap produced by node removal
The smallest positive eigenvalue of the Laplacian of a network is called the
spectral gap and characterizes various dynamics on networks. We propose
mathematical programming methods to maximize the spectral gap of a given
network by removing a fixed number of nodes. We formulate relaxed versions of
the original problem using semidefinite programming and apply them to example
networks.Comment: 1 figure. Short paper presented in CompleNet, Berlin, March 13-15
(2013