4 papers
cs.DS2020
On seat allocation problem with multiple merit lists
Rahul Kumar Singh, Sanjeev Saxena
In this note, we present a simpler algorithm for joint seat allocation problem in case there are two or more merit lists. In case of two lists (the current situation for Engineerin…
cs.DS2020
Edge colouring Game on Trees with maximum degree
Akshay Singh, Sanjeev Saxena
Consider the following game. We are given a tree and two players (say) Alice and Bob who alternately colour an edge of a tree (using one of colours). If all edges of the tr…
math.OC2017
A simple introduction to Karmarkar's Algorithm for Linear Programming
Sanjeev Saxena
An extremely simple, description of Karmarkar's algorithm with very few technical terms is given.
cs.DS2017
Ellipsoid Method for Linear Programming made simple
Sanjeev Saxena
In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, th…