The following pages link to Yen Hung Chen (Q442909):
Displayed 16 items.
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- (Q1623487) (redirect page) (← links)
- A frequency domain test for detecting nonstationary time series (Q1623488) (← links)
- Optimal economic production quantity policy for imperfect process with imperfect repair and maintenance (Q2378333) (← links)
- Hyper-Graeco-Latin Squares and Fractional Factorial Designs (Q2876207) (← links)
- Approximability results for the converse connected<i>p</i>-centre problem<sup>†</sup> (Q2958261) (← links)
- On the Full and Bottleneck Full Steiner Tree Problems (Q3082919) (← links)
- The Bottleneck Tree Alignment Problems (Q3600141) (← links)
- The bottleneck selected‐internal and partial terminal Steiner tree problems (Q4642405) (← links)
- (Q5237808) (← links)
- Cryptographic Hardware and Embedded Systems - CHES 2004 (Q5311452) (← links)
- Approximation algorithms for somek-source shortest paths spanning tree problems (Q5471085) (← links)
- Computational Science – ICCS 2005 (Q5709403) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901295) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)