Hans-Christoph Wirth

Available identifiers

zbMath Open wirth.hans-christophMaRDI QIDQ214963

List of research outcomes

Publication	Date of Publication	Type
Improving spanning trees by upgrading nodes	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	2010-06-16	Paper
Relaxed voting and competitive location under monotonous gain functions on trees	2010-05-05	Paper
\((r,p)\)-centroid problems on paths and trees	2009-11-06	Paper
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree	2009-06-24	Paper
Optimizing cost flows by edge cost and capacity upgrade	2007-04-26	Paper
Multiple voting location and single voting location on trees	2007-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4448759	2004-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4414508	2003-07-25	Paper
Reload cost problems: Minimum diameter spanning tree	2002-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q2766675	2002-07-09	Paper
On the flow cost lowering problem	2002-06-16	Paper
Euler is standing in line dial-a-ride problems with precedence-constraints	2001-11-12	Paper
Upgrading bottleneck constrained forests	2001-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q4789852	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4494412	2000-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4944969	2000-06-27	Paper
On the minimum label spanning tree problem	2000-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q4944966	2000-06-07	Paper
Improving Minimum Cost Spanning Trees by Upgrading Nodes	2000-02-06	Paper
Improving spanning trees by upgrading nodes	2000-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4232790	1999-03-15	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Hans-Christoph Wirth