Shashank K. Mehta

activity

20112019

most citedNew Facets of the QAP-Polytope

1 citations · 1 across the 7 of their papers we have counts for

collaborators

8 papers

cs.DS2019

Depth First Search in the Semi-streaming Model

Shahbaz Khan, Shashank K. Mehta

Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical DFS algorithm requires $O (m + n)$ time for a graph having $n$ vertices…

cs.CC2018

On the Maximum Distance Sublattice Problem and Closest Vector Problem

Rajendra Kumar, Shashank K Mehta, Mahesh Sreekumar Rajasree

In this paper, we introduce the Maximum Distance Sublattice Problem (MDSP). We observed that the problem of solving an instance of the Closest Vector Problem (CVP) in a lattice $\m…

math.OC2014★ 1 cited

New Facets of the QAP-Polytope

Pawan Kumar Aurora, Shashank K Mehta

The Birkhoff polytope is defined to be the convex hull of permutation matrices, $P_{σ} \forall σ \in S_{n}$ . We define a second-order permutation matrix $P_{σ}^{[2]}$ in $\mathbb{R}^{n^2…

math.SP2013

Eigenvalues and Eigenvectors of the Matrix of Permutation Counts

Pawan Auorora, Shashank K Mehta

Define a $(n^{4} + n^{2}) /2 \times (n^{4} + n^{2}) /2$ symmetric $B$ . $(ij) (k l)$ is an index where $i, j, k, l \in [n]$ , $(ab)$ is an unordered pair and $(k l)$ is an ordered pair when $i \neq = j$ , oth…

cs.DS2013

Completely Positive formulation of the Graph Isomorphism Problem

Shashank K Mehta, Pawan Aurora

Given two graphs $G_{1}$ and $G_{2}$ on $n$ vertices each, we define a graph $G$ on vertex set $V_{1} \times V_{2}$ and the edge set as the union of edges of $G_{1} \times G_{2} ˉ$ , $\bar{G_…

cs.DS2012

Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds

Pawan Aurora, Sumit Singh, Shashank K. Mehta

We study the Partial Degree Bounded Edge Packing (PDBEP) problem introduced in [5] by Zhang. They have shown that this problem is NP-Hard even for uniform degree constraint. They a…