2 citations · 6 across the 14 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015★ 1 cited
A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming
Kurt Mehlhorn, Sanjeev Saxena
Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We give a self-contained treatment of an interior-point method w…
cs.DS2015★ 1 cited
Maximal Independent Sets in Generalised Caterpillar Graphs
Neethi K. S., Sanjeev Saxena
A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backb…
cs.DS2015
Still Simpler Way of Introducing Interior-Point method for Linear Programming
Sanjeev Saxena
Linear Programming is now included in Algorithm undergraduate and postgraduate courses for Computer Science majors. It is possible to teach interior-point methods directly with jus…