|
"hung l j"的相關文件
顯示項目 1-10 / 10 (共1頁)
1
每頁顯示[10|25|50]項目
| 國立成功大學 |
2023 |
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
|
Kao, S.-S.;Klasing, R.;Hung, L.-J.;Lee, C.-W.;Hsieh, S.-Y. |
| 國立成功大學 |
2022 |
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs
|
Yeh, H.-P.;Lu, W.;Chen, L.-H.;Hung, L.-J.;Klasing, R.;Hsieh, S.-Y. |
| 國立成功大學 |
2022 |
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
|
Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R. |
| 國立成功大學 |
2021 |
A Parallel Algorithm for�Constructing Multiple Independent Spanning Trees in�Bubble-Sort Networks
|
Kao, S.-S.;Klasing, R.;Hung, L.-J.;Hsieh, S.-Y. |
| 國立成功大學 |
2020 |
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs
|
Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R. |
| 國立成功大學 |
2020 |
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs
|
Chang, S.-C.;Chen, L.-H.;Hung, L.-J.;Kao, S.-S.;Klasing, R. |
| 國立成功大學 |
2017 |
On the complexity of the star p-hub center problem with parameterized triangle inequality
|
Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R.;Lee, C.-W.;Wu, B.Y. |
| 國立成功大學 |
2017 |
An efficient fixed-parameter algorithm for the 2-plex bipartition problem
|
Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Rossmanith, P. |
| 國立成功大學 |
2017 |
The approximability of the p-hub center problem with parameterized triangle inequality
|
Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R. |
| 國立東華大學 |
2009 |
Block-graph width
|
Peng,S.-L.; Chang,M.-S.; Hung,L.-J.; Kloks,T. |
顯示項目 1-10 / 10 (共1頁)
1
每頁顯示[10|25|50]項目
|
