Steffen Borgwardt

Available identifiers

zbMath Open borgwardt.steffenMaRDI QIDQ312671

List of research outcomes

Publication	Date of Publication	Type
Circuits in extended formulations	2024-06-28	Paper
On Combinatorial Network Flows Algorithms and Circuit Augmentation for Pseudoflows	2023-12-19	Paper
Path Odd-Covers of Graphs	2023-06-10	Paper
A column generation approach to the discrete barycenter problem	2023-03-29	Paper
An Integer Program for Pricing Support Points of Exact Barycenters	2022-10-25	Paper
Circuits in Extended Formulations	2022-08-10	Paper
Circuit walks in integral polyhedra	2022-06-09	Paper
A polyhedral model for enumeration and optimization over the set of circuits	2022-01-05	Paper
A note on the approximability of deepest-descent circuit steps	2021-12-13	Paper
On the computational complexity of finding a sparse Wasserstein barycenter	2021-05-11	Paper
Constructing Clustering Transformations	2021-02-15	Paper
An Algorithm for the Separation-Preserving Transition of Clusterings	2020-12-10	Paper
A Note on the Approximability of Deepest-Descent Circuit Steps	2020-10-21	Paper
Good Clusterings Have Large Volume	2020-10-12	Paper
An implementation of steepest-descent augmentation for linear programs	2020-05-26	Paper
An implementation of steepest-descent augmentation for linear programs	2019-11-19	Paper
On the Computational Complexity of Finding a Sparse Wasserstein Barycenter	2019-10-16	Paper
A Column Generation Approach to the Discrete Barycenter Problem	2019-07-02	Paper
Power diagram detection with applications to information elicitation	2019-06-07	Paper
On the circuit diameter conjecture	2018-10-30	Paper
The diameters of network-flow polytopes satisfy the Hirsch conjecture	2018-09-28	Paper
Efficient solutions for weight-balanced partitioning problems	2018-05-24	Paper
The hierarchy of circuit diameters and transportation polytopes	2018-04-04	Paper
Edges versus circuits: a hierarchy of diameters in polyhedra	2018-03-29	Paper
Improved Linear Programs for Discrete Barycenters	2018-03-29	Paper
An LP-based \(k\)-means algorithm for balancing weighted point sets	2018-02-06	Paper
Circuit Walks in Integral Polyhedra	2017-12-05	Paper
Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland	2017-06-29	Paper
An LP-based, Strongly-Polynomial 2-Approximation Algorithm for Sparse Wasserstein Barycenters	2017-04-18	Paper
Discrete Wasserstein barycenters: optimal transport for discrete data	2016-11-29	Paper
Quadratic diameter bounds for dual network flow polyhedra	2016-09-16	Paper
On the Circuit Diameter of Dual Transportation Polyhedra	2015-11-27	Paper
Geometric clustering: mathematics for the consolidation of farmland	2015-08-31	Paper
Geometric clustering for the consolidation of farmland and woodland	2014-12-17	Paper
On the diameter of partition polytopes and vertex-disjoint cycle cover	2013-11-11	Paper
On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture	N/A	Paper
On the Diameter of a 2-Sum of Polyhedra	N/A	Paper
On the Hardness of Short and Sign-Compatible Circuit Walks	N/A	Paper
Combinatorics of generalized parking-function polytopes	N/A	Paper

Research outcomes over time

This page was built for person: Steffen Borgwardt