Tobias Brunsch

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Smoothed analysis of the successive shortest path algorithm Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-05-15	Paper
Bounds for the convergence time of local search in scheduling problems Web and Internet Economics	2017-02-10	Paper
Solving totally unimodular LPs with the shadow vertex algorithm (available as arXiv preprint)	2017-01-24	Paper
Smoothed analysis of the successive shortest path algorithm SIAM Journal on Computing	2015-12-11	Paper
Improved smoothed analysis of multiobjective optimization Journal of the ACM	2015-08-14	Paper
Lower bounds for the average and smoothed number of Pareto-optima Theory of Computing	2014-10-06	Paper
Smoothed performance guarantees for local search Mathematical Programming. Series A. Series B	2014-08-29	Paper
Improved smoothed analysis of multiobjective optimization Proceedings of the forty-fourth annual ACM symposium on Theory of computing	2014-05-13	Paper
A bad instance for \texttt{k-means++} Theoretical Computer Science	2014-01-16	Paper
Smoothed analysis of belief propagation for minimum-cost flow and matching Journal of Graph Algorithms and Applications	2013-11-28	Paper
Finding short paths on polytopes by the shadow vertex algorithm Automata, Languages, and Programming	2013-08-06	Paper
Smoothed analysis of belief propagation for minimum-cost flow and matching WALCOM: Algorithms and Computation	2013-04-12	Paper
Smoothed Performance Guarantees for Local Search Algorithms – ESA 2011	2011-09-16	Paper
Lower bounds for the smoothed number of Pareto optimal solutions Lecture Notes in Computer Science	2011-07-01	Paper
A bad instance for \(k\)-means++ Lecture Notes in Computer Science	2011-07-01	Paper

Research outcomes over time

This page was built for person: Tobias Brunsch