Steffen Borgwardt

Weston Grewe

Jon Lee

SIAM J. Discret. Math., March, 2024

An Integer Program for Pricing Support Points of Exact Barycenters.

[BibT_eX]

[DOI]

INFORMS J. Optim., 2024

Circuits in extended formulations.

[BibT_eX]

[DOI]

Matthias Brugger

Discret. Optim., 2024

2023

An Algorithm for the Separation-Preserving Transition of Clusterings.

[BibT_eX]

[DOI]

Felix Happach

Stetson Zirkelbach

INFORMS J. Optim., January, 2023

2022

An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters.

[BibT_eX]

[DOI]

Oper. Res., 2022

Circuit walks in integral polyhedra.

[BibT_eX]

[DOI]

Discret. Optim., 2022

A column generation approach to the discrete barycenter problem.

[BibT_eX]

[DOI]

Discret. Optim., 2022

A polyhedral model for enumeration and optimization over the set of circuits.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Constructing Clustering Transformations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

A note on the approximability of deepest-descent circuit steps.

[BibT_eX]

[DOI]

Cornelius Brand

Andreas Emil Feldmann

Martin Koutecký

Oper. Res. Lett., 2021

On the computational complexity of finding a sparse Wasserstein barycenter.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

2020

Improved Linear Programs for Discrete Barycenters.

[BibT_eX]

[DOI]

INFORMS J. Optim., January, 2020

An implementation of steepest-descent augmentation for linear programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

2019

Power Diagram Detection with Applications to Information Elicitation.

[BibT_eX]

[DOI]

Rafael M. Frongillo

J. Optim. Theory Appl., 2019

Good Clusterings Have Large Volume.

[BibT_eX]

[DOI]

Felix Happach

Oper. Res., 2019

2018

The diameters of network-flow polytopes satisfy the Hirsch conjecture.

[BibT_eX]

[DOI]

Jesús A. De Loera

Elisabeth Finhold

Math. Program., 2018

On the Circuit Diameter Conjecture.

[BibT_eX]

[DOI]

Tamon Stephen

Timothy Yusun

Discret. Comput. Geom., 2018

The hierarchy of circuit diameters and transportation polytopes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

An LP-based k-means algorithm for balancing weighted point sets.

[BibT_eX]

[DOI]

Andreas Brieden

Peter Gritzmann

Eur. J. Oper. Res., 2017

Reachability in Binary Multithreaded Programs Is Polynomial.

[BibT_eX]

[DOI]

Alexander Malkis

Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016

Quadratic diameter bounds for dual network flow polyhedra.

[BibT_eX]

[DOI]

Elisabeth Finhold

Raymond Hemmecke

Math. Program., 2016

Discrete Wasserstein barycenters: optimal transport for discrete data.

[BibT_eX]

[DOI]

Ethan B. Anderes

Jacob Miller

Math. Methods Oper. Res., 2016

Efficient solutions for weight-balanced partitioning problems.

[BibT_eX]

[DOI]

Shmuel Onn

Discret. Optim., 2016

2015

Data Analysis through Polyhedral Theory (Datenanalyse durch Polyedrische Theorie)

[BibT_eX]

[DOI]

PhD thesis, 2015

On the Circuit Diameter of Dual Transportation Polyhedra.

[BibT_eX]

[DOI]

Elisabeth Finhold

Raymond Hemmecke

SIAM J. Discret. Math., 2015

On Soft Power Diagrams.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms Oper. Res., 2015

2014

Threshold-based preprocessing for approximating the weighted dense k-subgraph problem.

[BibT_eX]

[DOI]

Felix Schmiedl

Eur. J. Oper. Res., 2014

2013

On the diameter of partition polytopes and vertex-disjoint cycle cover.

[BibT_eX]

[DOI]

Math. Program., 2013

A balanced k-means algorithm for weighted point sets.

[BibT_eX]

[DOI]

Andreas Brieden

Peter Gritzmann

CoRR, 2013

2011

Constrained Minimum-<i>k</i>-Star Clustering and its application to the consolidation of farmland.

[BibT_eX]

[DOI]