81 citations · 126 across the 20 of their papers we have counts for
21 papers
A note on the exact partition polytope of Frieze and Teng
Krishna Narayanan, Tamon Stephen
In 1994, Frieze and Teng proposed an integer linear programming formulation of the NP-Complete Exact Partition problem, whose LP-relaxation they claimed was non-degenerate. Contrar…
On the Circuit Diameter Conjecture
Steffen Borgwardt, Tamon Stephen, Timothy Yusun
From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets and dimension . In the seminal paper…
Algorithms for Colourful Simplicial Depth and Medians in the Plane
Olga Zasenko, Tamon Stephen
The colourful simplicial depth of a point x in the plane relative to a configuration of n points in k colour classes is exactly the number of closed simplices (triangles) with vert…
A Linear Time Algorithm for the -neighbour Traveling Salesman Problem on Halin graphs and extensions
Brad Woods, Abraham Punnen, Tamon Stephen
The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs are defined on all pairs of edges contained in the Ha…
Circuit diameter and Klee-Walkup constructions
Tamon Stephen, Timothy Yusun
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. He…
Computational Lower Bounds for Colourful Simplicial Depth
Antoine Deza, Tamon Stephen, Feng Xie
The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (col…