H.-C. Wirth

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
Improving spanning trees by upgrading nodes Automata, Languages and Programming	2018-07-04	Paper
An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees Information Processing Letters	2010-06-16	Paper
Relaxed voting and competitive location under monotonous gain functions on trees Discrete Applied Mathematics	2010-05-05	Paper
\((r,p)\)-centroid problems on paths and trees Theoretical Computer Science	2009-11-06	Paper
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree Journal of Discrete Algorithms	2009-06-24	Paper
Optimizing cost flows by edge cost and capacity upgrade Journal of Discrete Algorithms	2007-04-26	Paper
Multiple voting location and single voting location on trees European Journal of Operational Research	2007-04-19	Paper
scientific article; zbMATH DE number 2044936 (Why is no real title available?)	2004-02-18	Paper
scientific article; zbMATH DE number 1953104 (Why is no real title available?)	2003-07-25	Paper
Reload cost problems: Minimum diameter spanning tree Discrete Applied Mathematics	2002-07-30	Paper
scientific article; zbMATH DE number 1696527 (Why is no real title available?)	2002-07-09	Paper
On the flow cost lowering problem European Journal of Operational Research	2002-06-16	Paper
Euler is standing in line dial-a-ride problems with precedence-constraints Discrete Applied Mathematics	2001-11-12	Paper
Upgrading bottleneck constrained forests Discrete Applied Mathematics	2001-10-30	Paper
scientific article; zbMATH DE number 1859293 (Why is no real title available?)	2001-01-01	Paper
scientific article; zbMATH DE number 1487883 (Why is no real title available?)	2000-08-10	Paper
scientific article; zbMATH DE number 1420900 (Why is no real title available?)	2000-06-27	Paper
On the minimum label spanning tree problem Information Processing Letters	2000-06-20	Paper
scientific article; zbMATH DE number 1420897 (Why is no real title available?)	2000-06-07	Paper
Improving Minimum Cost Spanning Trees by Upgrading Nodes Journal of Algorithms	2000-02-06	Paper
Improving spanning trees by upgrading nodes Theoretical Computer Science	2000-01-12	Paper
scientific article; zbMATH DE number 1262800 (Why is no real title available?)	1999-03-15	Paper

Research outcomes over time

This page was built for person: H.-C. Wirth