# Andreas Brieden

According to our database

Collaborative distances:

^{1}, Andreas Brieden authored at least 12 papers between 1996 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Constrained clustering via diagrams: A unified theory and its application to electoral district design.

Eur. J. Oper. Res., 2017

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

Eur. J. Oper. Res., 2017

Electoral District Design via Constrained Clustering.

CoRR, 2017

2013

A balanced k-means algorithm for weighted point sets.

CoRR, 2013

2012

On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams.

SIAM J. Discret. Math., 2012

A Posteriori Vehicle Fleet Optimization and Scenario Evaluation.

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Optimal Robustness of Supply Chains.

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Constrained Minimum-

*k*-Star Clustering and its application to the consolidation of farmland.
Operational Research, 2011

2010

On Clustering Bodies: Geometry and Polyhedral Approximation.

Discret. Comput. Geom., 2010

2000

Oracle-polynomial-time approximation of largest simplices in convex bodies.

Discret. Math., 2000

1998

Approximation of Diameters: Randomization Doesn't Help.

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1996

On Helly's Theorem: Algorithms and Extensions

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996