2 citations · 2 across the 1 of their papers we have counts for
4 papers
An implementation of steepest-descent augmentation for linear programs
Steffen Borgwardt, Charles Viss
Generalizing the simplex method, circuit augmentation schemes for linear programs follow circuit directions through the interior of the underlying polyhedron. Steepest-descent augm…
Constructing Clustering Transformations
Steffen Borgwardt, Charles Viss
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, diff…
A Polyhedral Model for Enumeration and Optimization over the Set of Circuits
Steffen Borgwardt, Charles Viss
Circuits play a fundamental role in polyhedral theory and linear programming. For instance, circuits are used as step directions in various augmentation schemes for solving linear…
Uniquely -saturated Hypergraphs
András Gyárfás, Stephen G. Hartke, Charles Viss
In this paper we generalize the concept of uniquely -saturated graphs to hypergraphs. Let denote the complete -uniform hypergraph on vertices. For integers…