Mathias Hauptmann

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

2007

2 Mathias Hauptmann: On the Approximability of Dense Steiner Tree Problems. ICTCS 2007: 15-26

1 Mathias Hauptmann: The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes. ICTCS 2007: 151-162

	2007
2		Mathias Hauptmann: On the Approximability of Dense Steiner Tree Problems. ICTCS 2007: 15-26
1		Mathias Hauptmann: The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes. ICTCS 2007: 151-162