The following pages link to Steffen Borgwardt (Q312671):
Displayed 35 items.
- Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
- Discrete Wasserstein barycenters: optimal transport for discrete data (Q343818) (← links)
- On the diameter of partition polytopes and vertex-disjoint cycle cover (Q378108) (← links)
- Geometric clustering for the consolidation of farmland and woodland (Q483564) (← links)
- Geometric clustering: mathematics for the consolidation of farmland (Q494217) (← links)
- (Q1694905) (redirect page) (← links)
- An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
- Edges versus circuits: a hierarchy of diameters in polyhedra (Q1707378) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065) (← links)
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
- A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
- An implementation of steepest-descent augmentation for linear programs (Q2183215) (← links)
- Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland (Q2359522) (← links)
- Power diagram detection with applications to information elicitation (Q2420775) (← links)
- Circuit walks in integral polyhedra (Q2673232) (← links)
- A column generation approach to the discrete barycenter problem (Q2691196) (← links)
- On the Circuit Diameter of Dual Transportation Polyhedra (Q3453568) (← links)
- Good Clusterings Have Large Volume (Q4971590) (← links)
- Constructing Clustering Transformations (Q5150815) (← links)
- An LP-based, Strongly-Polynomial 2-Approximation Algorithm for Sparse Wasserstein Barycenters (Q6285669) (← links)
- Circuit Walks in Integral Polyhedra (Q6294876) (← links)
- Improved Linear Programs for Discrete Barycenters (Q6299763) (← links)
- A Column Generation Approach to the Discrete Barycenter Problem (Q6321429) (← links)
- On the Computational Complexity of Finding a Sparse Wasserstein Barycenter (Q6327347) (← links)
- An implementation of steepest-descent augmentation for linear programs (Q6329523) (← links)
- A Note on the Approximability of Deepest-Descent Circuit Steps (Q6351860) (← links)
- An Algorithm for the Separation-Preserving Transition of Clusterings (Q6355772) (← links)
- Circuits in Extended Formulations (Q6407538) (← links)
- An Integer Program for Pricing Support Points of Exact Barycenters (Q6415090) (← links)
- Path Odd-Covers of Graphs (Q6439897) (← links)
- On Combinatorial Network Flows Algorithms and Circuit Augmentation for Pseudoflows (Q6464299) (← links)