|
English
|
正體中文
|
简体中文
|
Total items :2856704
|
|
Visitors :
53695009
Online Users :
1827
Project Commissioned by the Ministry of Education
Project Executed by National Taiwan University Library
|
|
|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"klasing r"
Showing items 1-9 of 9 (1 Page(s) Totally)
1
View [10|25|50] records per page
| 國立成功大學 |
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 |
Monitoring the edges of a graph using distances
|
Foucaud, Foucaud F.;Kao, S.-S.;Klasing, R.;Miller, Miller M.;Ryan, J. |
| 國立成功大學 |
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 |
The approximability of the p-hub center problem with parameterized triangle inequality
|
Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R. |
Showing items 1-9 of 9 (1 Page(s) Totally)
1
View [10|25|50] records per page
|
